./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.12.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_label47+token_ring.12.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 c3f3364fd5ba51681dbe9ac9cfcd9f114289823313a53e53a305bf8ae66907c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:25:27,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:25:27,850 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:25:27,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:25:27,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:25:27,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:25:27,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:25:27,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:25:27,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:25:27,876 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:25:27,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:25:27,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:25:27,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:25:27,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:25:27,876 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:25:27,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:25:27,877 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:25:27,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:25:27,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:25:27,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:25:27,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:25:27,878 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:25:27,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:25:27,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:25:27,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:25:27,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:25:27,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:25:27,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:25:27,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:25:27,878 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 -> c3f3364fd5ba51681dbe9ac9cfcd9f114289823313a53e53a305bf8ae66907c7 [2025-01-09 05:25:28,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:25:28,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:25:28,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:25:28,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:25:28,205 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:25:28,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label47+token_ring.12.cil-2.c [2025-01-09 05:25:29,475 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d5784d33/7637c87e7f58474296051cef4b1af91d/FLAGccd619eb8 [2025-01-09 05:25:30,042 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:25:30,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.12.cil-2.c [2025-01-09 05:25:30,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d5784d33/7637c87e7f58474296051cef4b1af91d/FLAGccd619eb8 [2025-01-09 05:25:30,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d5784d33/7637c87e7f58474296051cef4b1af91d [2025-01-09 05:25:30,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:25:30,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:25:30,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:25:30,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:25:30,578 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:25:30,579 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:25:30" (1/1) ... [2025-01-09 05:25:30,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65595679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:30, skipping insertion in model container [2025-01-09 05:25:30,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:25:30" (1/1) ... [2025-01-09 05:25:30,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:25:31,820 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_label47+token_ring.12.cil-2.c[377612,377625] [2025-01-09 05:25:31,865 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_label47+token_ring.12.cil-2.c[383339,383352] [2025-01-09 05:25:32,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:25:32,200 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:25:32,761 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_label47+token_ring.12.cil-2.c[377612,377625] [2025-01-09 05:25:32,768 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_label47+token_ring.12.cil-2.c[383339,383352] [2025-01-09 05:25:32,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:25:32,866 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:25:32,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:32 WrapperNode [2025-01-09 05:25:32,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:25:32,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:25:32,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:25:32,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:25:32,878 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:25:32" (1/1) ... [2025-01-09 05:25:32,940 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:25:32" (1/1) ... [2025-01-09 05:25:33,327 INFO L138 Inliner]: procedures = 68, calls = 77, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 13185 [2025-01-09 05:25:33,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:25:33,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:25:33,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:25:33,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:25:33,340 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:32" (1/1) ... [2025-01-09 05:25:33,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:32" (1/1) ... [2025-01-09 05:25:33,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:32" (1/1) ... [2025-01-09 05:25:33,599 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:25:33,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:32" (1/1) ... [2025-01-09 05:25:33,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:32" (1/1) ... [2025-01-09 05:25:33,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:32" (1/1) ... [2025-01-09 05:25:33,792 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:32" (1/1) ... [2025-01-09 05:25:33,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:32" (1/1) ... [2025-01-09 05:25:33,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:32" (1/1) ... [2025-01-09 05:25:33,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:32" (1/1) ... [2025-01-09 05:25:34,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:25:34,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:25:34,009 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:25:34,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:25:34,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:32" (1/1) ... [2025-01-09 05:25:34,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:25:34,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:25:34,050 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:25:34,053 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:25:34,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:25:34,068 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:25:34,069 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:25:34,069 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:25:34,069 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:25:34,069 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:25:34,069 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:25:34,069 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:25:34,069 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:25:34,069 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:25:34,069 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:25:34,069 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:25:34,069 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:25:34,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:25:34,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:25:34,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:25:34,156 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:25:34,157 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:25:40,783 INFO L? ?]: Removed 1755 outVars from TransFormulas that were not future-live. [2025-01-09 05:25:40,784 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:25:40,846 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:25:40,847 INFO L312 CfgBuilder]: Removed 16 assume(true) statements. [2025-01-09 05:25:40,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:25:40 BoogieIcfgContainer [2025-01-09 05:25:40,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:25:40,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:25:40,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:25:40,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:25:40,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:25:30" (1/3) ... [2025-01-09 05:25:40,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172e6728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:25:40, skipping insertion in model container [2025-01-09 05:25:40,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:32" (2/3) ... [2025-01-09 05:25:40,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172e6728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:25:40, skipping insertion in model container [2025-01-09 05:25:40,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:25:40" (3/3) ... [2025-01-09 05:25:40,854 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.12.cil-2.c [2025-01-09 05:25:40,864 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:25:40,866 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label47+token_ring.12.cil-2.c that has 7 procedures, 2563 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-01-09 05:25:40,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:25:40,993 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;@91ef9ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:25:40,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:25:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 2563 states, 2529 states have (on average 1.8366943455911426) internal successors, (4645), 2531 states have internal predecessors, (4645), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 05:25:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 05:25:41,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:41,022 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] [2025-01-09 05:25:41,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:41,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:41,031 INFO L85 PathProgramCache]: Analyzing trace with hash 344092430, now seen corresponding path program 1 times [2025-01-09 05:25:41,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:41,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195537946] [2025-01-09 05:25:41,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:41,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:41,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 05:25:41,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 05:25:41,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:41,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:41,409 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:25:41,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:41,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195537946] [2025-01-09 05:25:41,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195537946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:41,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:41,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:25:41,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60038993] [2025-01-09 05:25:41,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:41,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:25:41,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:41,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:25:41,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:25:41,441 INFO L87 Difference]: Start difference. First operand has 2563 states, 2529 states have (on average 1.8366943455911426) internal successors, (4645), 2531 states have internal predecessors, (4645), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:25:41,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:41,656 INFO L93 Difference]: Finished difference Result 5119 states and 9381 transitions. [2025-01-09 05:25:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:25:41,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 176 [2025-01-09 05:25:41,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:41,680 INFO L225 Difference]: With dead ends: 5119 [2025-01-09 05:25:41,680 INFO L226 Difference]: Without dead ends: 2496 [2025-01-09 05:25:41,690 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:25:41,698 INFO L435 NwaCegarLoop]: 4618 mSDtfsCounter, 590 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 8640 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:25:41,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 8640 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:25:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-01-09 05:25:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2496. [2025-01-09 05:25:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2462 states have (on average 1.826969943135662) internal successors, (4498), 2464 states have internal predecessors, (4498), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 05:25:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 4550 transitions. [2025-01-09 05:25:41,850 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 4550 transitions. Word has length 176 [2025-01-09 05:25:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:41,851 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 4550 transitions. [2025-01-09 05:25:41,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:25:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 4550 transitions. [2025-01-09 05:25:41,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 05:25:41,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:41,856 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] [2025-01-09 05:25:41,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:25:41,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:41,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:41,857 INFO L85 PathProgramCache]: Analyzing trace with hash -164686384, now seen corresponding path program 1 times [2025-01-09 05:25:41,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:41,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372839789] [2025-01-09 05:25:41,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:41,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:41,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 05:25:41,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 05:25:41,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:41,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:42,067 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:25:42,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:42,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372839789] [2025-01-09 05:25:42,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372839789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:42,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:42,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:25:42,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602427639] [2025-01-09 05:25:42,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:42,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:25:42,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:42,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:25:42,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:25:42,072 INFO L87 Difference]: Start difference. First operand 2496 states and 4550 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:25:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:42,137 INFO L93 Difference]: Finished difference Result 2855 states and 5115 transitions. [2025-01-09 05:25:42,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:25:42,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 176 [2025-01-09 05:25:42,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:42,151 INFO L225 Difference]: With dead ends: 2855 [2025-01-09 05:25:42,152 INFO L226 Difference]: Without dead ends: 2496 [2025-01-09 05:25:42,154 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:25:42,155 INFO L435 NwaCegarLoop]: 4548 mSDtfsCounter, 576 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 8506 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:25:42,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 8506 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:25:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-01-09 05:25:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2496. [2025-01-09 05:25:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2462 states have (on average 1.8265637692932575) internal successors, (4497), 2464 states have internal predecessors, (4497), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 05:25:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 4549 transitions. [2025-01-09 05:25:42,215 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 4549 transitions. Word has length 176 [2025-01-09 05:25:42,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:42,216 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 4549 transitions. [2025-01-09 05:25:42,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:25:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 4549 transitions. [2025-01-09 05:25:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 05:25:42,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:42,221 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] [2025-01-09 05:25:42,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:25:42,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:42,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:42,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2030542482, now seen corresponding path program 1 times [2025-01-09 05:25:42,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:42,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047437622] [2025-01-09 05:25:42,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:42,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:42,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 05:25:42,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 05:25:42,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:42,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:42,439 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:25:42,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:42,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047437622] [2025-01-09 05:25:42,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047437622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:42,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:42,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:25:42,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272616317] [2025-01-09 05:25:42,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:42,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:25:42,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:42,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:25:42,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:25:42,440 INFO L87 Difference]: Start difference. First operand 2496 states and 4549 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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:25:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:43,108 INFO L93 Difference]: Finished difference Result 3254 states and 5763 transitions. [2025-01-09 05:25:43,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:25:43,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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 176 [2025-01-09 05:25:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:43,121 INFO L225 Difference]: With dead ends: 3254 [2025-01-09 05:25:43,121 INFO L226 Difference]: Without dead ends: 2899 [2025-01-09 05:25:43,123 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:25:43,123 INFO L435 NwaCegarLoop]: 4416 mSDtfsCounter, 5105 mSDsluCounter, 9086 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5125 SdHoareTripleChecker+Valid, 13502 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:43,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5125 Valid, 13502 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:25:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2025-01-09 05:25:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 2870. [2025-01-09 05:25:43,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2870 states, 2808 states have (on average 1.7987891737891737) internal successors, (5051), 2811 states have internal predecessors, (5051), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-01-09 05:25:43,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 5146 transitions. [2025-01-09 05:25:43,191 INFO L78 Accepts]: Start accepts. Automaton has 2870 states and 5146 transitions. Word has length 176 [2025-01-09 05:25:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:43,192 INFO L471 AbstractCegarLoop]: Abstraction has 2870 states and 5146 transitions. [2025-01-09 05:25:43,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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:25:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2870 states and 5146 transitions. [2025-01-09 05:25:43,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 05:25:43,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:43,194 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] [2025-01-09 05:25:43,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:25:43,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:43,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:43,195 INFO L85 PathProgramCache]: Analyzing trace with hash -272042474, now seen corresponding path program 1 times [2025-01-09 05:25:43,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:43,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756390993] [2025-01-09 05:25:43,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:43,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:43,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 05:25:43,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 05:25:43,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:43,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:43,425 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:25:43,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:43,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756390993] [2025-01-09 05:25:43,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756390993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:43,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:43,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:43,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19356853] [2025-01-09 05:25:43,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:43,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:43,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:43,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:43,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:43,428 INFO L87 Difference]: Start difference. First operand 2870 states and 5146 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:25:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:44,274 INFO L93 Difference]: Finished difference Result 4079 states and 7102 transitions. [2025-01-09 05:25:44,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:44,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 05:25:44,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:44,291 INFO L225 Difference]: With dead ends: 4079 [2025-01-09 05:25:44,292 INFO L226 Difference]: Without dead ends: 3350 [2025-01-09 05:25:44,295 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:25:44,296 INFO L435 NwaCegarLoop]: 4731 mSDtfsCounter, 5115 mSDsluCounter, 14247 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5135 SdHoareTripleChecker+Valid, 18978 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:44,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5135 Valid, 18978 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:25:44,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2025-01-09 05:25:44,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3217. [2025-01-09 05:25:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3217 states, 3127 states have (on average 1.775183882315318) internal successors, (5551), 3131 states have internal predecessors, (5551), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-01-09 05:25:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 5691 transitions. [2025-01-09 05:25:44,398 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 5691 transitions. Word has length 176 [2025-01-09 05:25:44,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:44,399 INFO L471 AbstractCegarLoop]: Abstraction has 3217 states and 5691 transitions. [2025-01-09 05:25:44,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:25:44,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 5691 transitions. [2025-01-09 05:25:44,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 05:25:44,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:44,403 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] [2025-01-09 05:25:44,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:25:44,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:44,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:44,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1622291412, now seen corresponding path program 1 times [2025-01-09 05:25:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:44,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042246792] [2025-01-09 05:25:44,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:44,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:44,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 05:25:44,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 05:25:44,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:44,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:44,575 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:25:44,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:44,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042246792] [2025-01-09 05:25:44,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042246792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:44,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:44,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:44,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282184089] [2025-01-09 05:25:44,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:44,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:44,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:44,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:44,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:44,577 INFO L87 Difference]: Start difference. First operand 3217 states and 5691 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:25:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:45,301 INFO L93 Difference]: Finished difference Result 5190 states and 8876 transitions. [2025-01-09 05:25:45,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:45,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 05:25:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:45,320 INFO L225 Difference]: With dead ends: 5190 [2025-01-09 05:25:45,320 INFO L226 Difference]: Without dead ends: 4114 [2025-01-09 05:25:45,326 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:25:45,326 INFO L435 NwaCegarLoop]: 4458 mSDtfsCounter, 5142 mSDsluCounter, 13593 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5162 SdHoareTripleChecker+Valid, 18051 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:45,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5162 Valid, 18051 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:25:45,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4114 states. [2025-01-09 05:25:45,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4114 to 3960. [2025-01-09 05:25:45,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3960 states, 3812 states have (on average 1.742392444910808) internal successors, (6642), 3820 states have internal predecessors, (6642), 110 states have call successors, (110), 30 states have call predecessors, (110), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-01-09 05:25:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 6878 transitions. [2025-01-09 05:25:45,463 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 6878 transitions. Word has length 176 [2025-01-09 05:25:45,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:45,463 INFO L471 AbstractCegarLoop]: Abstraction has 3960 states and 6878 transitions. [2025-01-09 05:25:45,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:25:45,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 6878 transitions. [2025-01-09 05:25:45,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 05:25:45,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:45,467 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] [2025-01-09 05:25:45,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:25:45,468 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:45,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:45,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1226095018, now seen corresponding path program 1 times [2025-01-09 05:25:45,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:45,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748061247] [2025-01-09 05:25:45,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:45,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:45,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 05:25:45,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 05:25:45,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:45,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:45,644 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:25:45,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:45,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748061247] [2025-01-09 05:25:45,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748061247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:45,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:45,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:45,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730393058] [2025-01-09 05:25:45,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:45,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:45,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:45,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:45,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:45,646 INFO L87 Difference]: Start difference. First operand 3960 states and 6878 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:25:46,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:46,497 INFO L93 Difference]: Finished difference Result 7603 states and 12809 transitions. [2025-01-09 05:25:46,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:46,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 05:25:46,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:46,517 INFO L225 Difference]: With dead ends: 7603 [2025-01-09 05:25:46,517 INFO L226 Difference]: Without dead ends: 5784 [2025-01-09 05:25:46,522 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:25:46,523 INFO L435 NwaCegarLoop]: 4724 mSDtfsCounter, 5105 mSDsluCounter, 14226 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5125 SdHoareTripleChecker+Valid, 18950 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:46,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5125 Valid, 18950 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:25:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2025-01-09 05:25:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 5587. [2025-01-09 05:25:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5587 states, 5317 states have (on average 1.708858378785029) internal successors, (9086), 5339 states have internal predecessors, (9086), 194 states have call successors, (194), 54 states have call predecessors, (194), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-01-09 05:25:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5587 states to 5587 states and 9538 transitions. [2025-01-09 05:25:46,687 INFO L78 Accepts]: Start accepts. Automaton has 5587 states and 9538 transitions. Word has length 176 [2025-01-09 05:25:46,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:46,689 INFO L471 AbstractCegarLoop]: Abstraction has 5587 states and 9538 transitions. [2025-01-09 05:25:46,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:25:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 5587 states and 9538 transitions. [2025-01-09 05:25:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 05:25:46,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:46,692 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] [2025-01-09 05:25:46,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:25:46,693 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:46,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:46,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2145704852, now seen corresponding path program 1 times [2025-01-09 05:25:46,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:46,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252561621] [2025-01-09 05:25:46,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:46,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:46,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 05:25:46,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 05:25:46,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:46,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:46,836 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:25:46,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:46,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252561621] [2025-01-09 05:25:46,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252561621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:46,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:46,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:46,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140741227] [2025-01-09 05:25:46,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:46,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:46,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:46,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:46,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:46,839 INFO L87 Difference]: Start difference. First operand 5587 states and 9538 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:25:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:47,597 INFO L93 Difference]: Finished difference Result 12936 states and 21731 transitions. [2025-01-09 05:25:47,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:47,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 05:25:47,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:47,632 INFO L225 Difference]: With dead ends: 12936 [2025-01-09 05:25:47,632 INFO L226 Difference]: Without dead ends: 9490 [2025-01-09 05:25:47,646 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:25:47,647 INFO L435 NwaCegarLoop]: 4717 mSDtfsCounter, 5097 mSDsluCounter, 14207 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5117 SdHoareTripleChecker+Valid, 18924 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:47,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5117 Valid, 18924 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:25:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9490 states. [2025-01-09 05:25:47,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9490 to 9219. [2025-01-09 05:25:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9219 states, 8687 states have (on average 1.6889605157131347) internal successors, (14672), 8755 states have internal predecessors, (14672), 362 states have call successors, (362), 102 states have call predecessors, (362), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-01-09 05:25:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9219 states to 9219 states and 15652 transitions. [2025-01-09 05:25:47,884 INFO L78 Accepts]: Start accepts. Automaton has 9219 states and 15652 transitions. Word has length 176 [2025-01-09 05:25:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:47,884 INFO L471 AbstractCegarLoop]: Abstraction has 9219 states and 15652 transitions. [2025-01-09 05:25:47,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:25:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 9219 states and 15652 transitions. [2025-01-09 05:25:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 05:25:47,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:47,890 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] [2025-01-09 05:25:47,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:25:47,891 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:47,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:47,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1881057362, now seen corresponding path program 1 times [2025-01-09 05:25:47,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:47,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462167536] [2025-01-09 05:25:47,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:47,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:47,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 05:25:47,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 05:25:47,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:47,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:48,024 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:25:48,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:48,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462167536] [2025-01-09 05:25:48,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462167536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:48,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:48,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:48,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384090460] [2025-01-09 05:25:48,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:48,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:48,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:48,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:48,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:48,027 INFO L87 Difference]: Start difference. First operand 9219 states and 15652 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:25:48,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:48,926 INFO L93 Difference]: Finished difference Result 25096 states and 42815 transitions. [2025-01-09 05:25:48,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:48,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 05:25:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:48,983 INFO L225 Difference]: With dead ends: 25096 [2025-01-09 05:25:48,983 INFO L226 Difference]: Without dead ends: 18018 [2025-01-09 05:25:49,007 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:25:49,008 INFO L435 NwaCegarLoop]: 4714 mSDtfsCounter, 5092 mSDsluCounter, 14198 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5112 SdHoareTripleChecker+Valid, 18912 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:49,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5112 Valid, 18912 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:25:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18018 states. [2025-01-09 05:25:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18018 to 17590. [2025-01-09 05:25:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17590 states, 16480 states have (on average 1.692233009708738) internal successors, (27888), 16694 states have internal predecessors, (27888), 698 states have call successors, (698), 198 states have call predecessors, (698), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-01-09 05:25:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17590 states to 17590 states and 30308 transitions. [2025-01-09 05:25:49,458 INFO L78 Accepts]: Start accepts. Automaton has 17590 states and 30308 transitions. Word has length 176 [2025-01-09 05:25:49,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:49,459 INFO L471 AbstractCegarLoop]: Abstraction has 17590 states and 30308 transitions. [2025-01-09 05:25:49,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:25:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 17590 states and 30308 transitions. [2025-01-09 05:25:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 05:25:49,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:49,467 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] [2025-01-09 05:25:49,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:25:49,467 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:49,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:49,468 INFO L85 PathProgramCache]: Analyzing trace with hash -482784300, now seen corresponding path program 1 times [2025-01-09 05:25:49,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:49,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394863319] [2025-01-09 05:25:49,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:49,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:49,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 05:25:49,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 05:25:49,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:49,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:49,689 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:25:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:49,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394863319] [2025-01-09 05:25:49,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394863319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:49,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:49,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:25:49,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609267234] [2025-01-09 05:25:49,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:49,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:25:49,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:49,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:25:49,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:25:49,690 INFO L87 Difference]: Start difference. First operand 17590 states and 30308 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:25:50,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:50,344 INFO L93 Difference]: Finished difference Result 37939 states and 66782 transitions. [2025-01-09 05:25:50,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:25:50,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 05:25:50,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:50,414 INFO L225 Difference]: With dead ends: 37939 [2025-01-09 05:25:50,415 INFO L226 Difference]: Without dead ends: 22490 [2025-01-09 05:25:50,460 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:25:50,464 INFO L435 NwaCegarLoop]: 4393 mSDtfsCounter, 4761 mSDsluCounter, 8631 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4781 SdHoareTripleChecker+Valid, 13024 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:50,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4781 Valid, 13024 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:25:50,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22490 states. [2025-01-09 05:25:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22490 to 17590. [2025-01-09 05:25:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17590 states, 16480 states have (on average 1.6902305825242718) internal successors, (27855), 16694 states have internal predecessors, (27855), 698 states have call successors, (698), 198 states have call predecessors, (698), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-01-09 05:25:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17590 states to 17590 states and 30275 transitions. [2025-01-09 05:25:51,198 INFO L78 Accepts]: Start accepts. Automaton has 17590 states and 30275 transitions. Word has length 176 [2025-01-09 05:25:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:51,198 INFO L471 AbstractCegarLoop]: Abstraction has 17590 states and 30275 transitions. [2025-01-09 05:25:51,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:25:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 17590 states and 30275 transitions. [2025-01-09 05:25:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 05:25:51,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:51,207 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] [2025-01-09 05:25:51,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:25:51,208 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:51,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:51,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1805963246, now seen corresponding path program 1 times [2025-01-09 05:25:51,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:51,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201729068] [2025-01-09 05:25:51,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:51,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:51,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 05:25:51,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 05:25:51,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:51,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:51,363 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:25:51,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:51,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201729068] [2025-01-09 05:25:51,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201729068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:51,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:51,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:51,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413820916] [2025-01-09 05:25:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:51,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:51,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:51,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:51,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:51,365 INFO L87 Difference]: Start difference. First operand 17590 states and 30275 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:25:52,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:52,626 INFO L93 Difference]: Finished difference Result 53391 states and 94082 transitions. [2025-01-09 05:25:52,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:52,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 05:25:52,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:52,735 INFO L225 Difference]: With dead ends: 53391 [2025-01-09 05:25:52,735 INFO L226 Difference]: Without dead ends: 37942 [2025-01-09 05:25:52,770 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:25:52,771 INFO L435 NwaCegarLoop]: 4706 mSDtfsCounter, 5079 mSDsluCounter, 14175 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5099 SdHoareTripleChecker+Valid, 18881 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:52,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5099 Valid, 18881 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:25:52,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37942 states. [2025-01-09 05:25:53,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37942 to 37248. [2025-01-09 05:25:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37248 states, 34820 states have (on average 1.7112291786329696) internal successors, (59585), 35488 states have internal predecessors, (59585), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-01-09 05:25:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37248 states to 37248 states and 66421 transitions. [2025-01-09 05:25:53,880 INFO L78 Accepts]: Start accepts. Automaton has 37248 states and 66421 transitions. Word has length 176 [2025-01-09 05:25:53,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:53,880 INFO L471 AbstractCegarLoop]: Abstraction has 37248 states and 66421 transitions. [2025-01-09 05:25:53,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:25:53,881 INFO L276 IsEmpty]: Start isEmpty. Operand 37248 states and 66421 transitions. [2025-01-09 05:25:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 05:25:53,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:53,894 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] [2025-01-09 05:25:53,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:25:53,894 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:53,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:53,895 INFO L85 PathProgramCache]: Analyzing trace with hash 91016212, now seen corresponding path program 1 times [2025-01-09 05:25:53,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:53,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214336818] [2025-01-09 05:25:53,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:53,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:53,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 05:25:53,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 05:25:53,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:53,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:54,032 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:25:54,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:54,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214336818] [2025-01-09 05:25:54,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214336818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:54,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:54,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:54,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131508216] [2025-01-09 05:25:54,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:54,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:54,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:54,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:54,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:54,035 INFO L87 Difference]: Start difference. First operand 37248 states and 66421 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:25:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:56,880 INFO L93 Difference]: Finished difference Result 121411 states and 225266 transitions. [2025-01-09 05:25:56,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:56,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 05:25:56,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:57,307 INFO L225 Difference]: With dead ends: 121411 [2025-01-09 05:25:57,308 INFO L226 Difference]: Without dead ends: 86304 [2025-01-09 05:25:57,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:57,458 INFO L435 NwaCegarLoop]: 4703 mSDtfsCounter, 5074 mSDsluCounter, 14166 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5094 SdHoareTripleChecker+Valid, 18869 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:57,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5094 Valid, 18869 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:25:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86304 states. [2025-01-09 05:26:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86304 to 85069. [2025-01-09 05:26:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85069 states, 79519 states have (on average 1.7425395188571284) internal successors, (138565), 81581 states have internal predecessors, (138565), 2714 states have call successors, (2714), 774 states have call predecessors, (2714), 2834 states have return successors, (19098), 2841 states have call predecessors, (19098), 2714 states have call successors, (19098) [2025-01-09 05:26:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85069 states to 85069 states and 160377 transitions. [2025-01-09 05:26:01,087 INFO L78 Accepts]: Start accepts. Automaton has 85069 states and 160377 transitions. Word has length 176 [2025-01-09 05:26:01,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:26:01,089 INFO L471 AbstractCegarLoop]: Abstraction has 85069 states and 160377 transitions. [2025-01-09 05:26:01,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:26:01,089 INFO L276 IsEmpty]: Start isEmpty. Operand 85069 states and 160377 transitions. [2025-01-09 05:26:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 05:26:01,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:26:01,115 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] [2025-01-09 05:26:01,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:26:01,115 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:26:01,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:26:01,116 INFO L85 PathProgramCache]: Analyzing trace with hash 429303762, now seen corresponding path program 1 times [2025-01-09 05:26:01,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:26:01,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197622900] [2025-01-09 05:26:01,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:26:01,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:26:01,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 05:26:01,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 05:26:01,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:26:01,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:26:01,267 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:26:01,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:26:01,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197622900] [2025-01-09 05:26:01,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197622900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:26:01,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:26:01,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:26:01,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303930118] [2025-01-09 05:26:01,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:26:01,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:26:01,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:26:01,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:26:01,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:26:01,270 INFO L87 Difference]: Start difference. First operand 85069 states and 160377 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:26:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:26:07,412 INFO L93 Difference]: Finished difference Result 289952 states and 577428 transitions. [2025-01-09 05:26:07,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:26:07,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 05:26:07,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:26:09,114 INFO L225 Difference]: With dead ends: 289952 [2025-01-09 05:26:09,114 INFO L226 Difference]: Without dead ends: 207024 [2025-01-09 05:26:09,299 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:26:09,300 INFO L435 NwaCegarLoop]: 4441 mSDtfsCounter, 5113 mSDsluCounter, 13541 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5133 SdHoareTripleChecker+Valid, 17982 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:26:09,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5133 Valid, 17982 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:26:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207024 states. [2025-01-09 05:26:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207024 to 204768. [2025-01-09 05:26:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204768 states, 191516 states have (on average 1.7763581110716598) internal successors, (340201), 197824 states have internal predecessors, (340201), 5402 states have call successors, (5402), 1542 states have call predecessors, (5402), 7848 states have return successors, (70938), 5657 states have call predecessors, (70938), 5402 states have call successors, (70938) [2025-01-09 05:26:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204768 states to 204768 states and 416541 transitions. [2025-01-09 05:26:19,304 INFO L78 Accepts]: Start accepts. Automaton has 204768 states and 416541 transitions. Word has length 176 [2025-01-09 05:26:19,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:26:19,309 INFO L471 AbstractCegarLoop]: Abstraction has 204768 states and 416541 transitions. [2025-01-09 05:26:19,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:26:19,309 INFO L276 IsEmpty]: Start isEmpty. Operand 204768 states and 416541 transitions. [2025-01-09 05:26:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 05:26:19,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:26:19,356 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] [2025-01-09 05:26:19,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:26:19,356 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:26:19,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:26:19,357 INFO L85 PathProgramCache]: Analyzing trace with hash 855858260, now seen corresponding path program 1 times [2025-01-09 05:26:19,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:26:19,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327475552] [2025-01-09 05:26:19,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:26:19,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:26:19,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 05:26:19,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 05:26:19,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:26:19,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:26:19,489 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:26:19,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:26:19,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327475552] [2025-01-09 05:26:19,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327475552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:26:19,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:26:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:26:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697652409] [2025-01-09 05:26:19,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:26:19,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:26:19,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:26:19,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:26:19,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:26:19,493 INFO L87 Difference]: Start difference. First operand 204768 states and 416541 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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)