./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label40+token_ring.10.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_label40+token_ring.10.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 b2d817c779a7c88ce14310f494c47ad6ae04ac82c2c2c295ca0b97645ed08cbd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:14:35,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:14:35,901 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:14:35,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:14:35,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:14:35,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:14:35,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:14:35,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:14:35,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:14:35,935 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:14:35,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:14:35,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:14:35,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:14:35,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:14:35,935 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:14:35,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:14:35,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:14:35,936 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:14:35,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:14:35,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:14:35,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:14:35,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:14:35,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:14:35,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:14:35,936 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:14:35,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:14:35,936 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:14:35,936 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:14:35,936 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:14:35,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:14:35,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:14:35,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:14:35,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:14:35,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:14:35,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:14:35,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:14:35,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:14:35,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:14:35,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:14:35,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:14:35,938 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:14:35,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:14:35,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:14:35,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:14:35,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:14:35,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:14:35,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:14:35,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:14:35,938 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 -> b2d817c779a7c88ce14310f494c47ad6ae04ac82c2c2c295ca0b97645ed08cbd [2025-01-09 05:14:36,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:14:36,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:14:36,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:14:36,216 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:14:36,216 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:14:36,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label40+token_ring.10.cil-2.c [2025-01-09 05:14:37,356 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e52b01f76/063f05f29cdb4bd597fb37f307efcc7a/FLAG3fce452a7 [2025-01-09 05:14:38,095 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:14:38,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.10.cil-2.c [2025-01-09 05:14:38,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e52b01f76/063f05f29cdb4bd597fb37f307efcc7a/FLAG3fce452a7 [2025-01-09 05:14:38,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e52b01f76/063f05f29cdb4bd597fb37f307efcc7a [2025-01-09 05:14:38,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:14:38,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:14:38,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:14:38,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:14:38,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:14:38,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:14:38" (1/1) ... [2025-01-09 05:14:38,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8a2b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:38, skipping insertion in model container [2025-01-09 05:14:38,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:14:38" (1/1) ... [2025-01-09 05:14:38,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:14:39,792 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_label40+token_ring.10.cil-2.c[377069,377082] [2025-01-09 05:14:39,828 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_label40+token_ring.10.cil-2.c[383339,383352] [2025-01-09 05:14:40,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:14:40,072 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:14:40,676 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_label40+token_ring.10.cil-2.c[377069,377082] [2025-01-09 05:14:40,683 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_label40+token_ring.10.cil-2.c[383339,383352] [2025-01-09 05:14:40,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:14:40,752 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:14:40,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:40 WrapperNode [2025-01-09 05:14:40,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:14:40,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:14:40,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:14:40,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:14:40,760 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:14:40" (1/1) ... [2025-01-09 05:14:40,831 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:14:40" (1/1) ... [2025-01-09 05:14:41,159 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13071 [2025-01-09 05:14:41,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:14:41,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:14:41,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:14:41,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:14:41,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:40" (1/1) ... [2025-01-09 05:14:41,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:40" (1/1) ... [2025-01-09 05:14:41,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:40" (1/1) ... [2025-01-09 05:14:41,263 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:14:41,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:40" (1/1) ... [2025-01-09 05:14:41,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:40" (1/1) ... [2025-01-09 05:14:41,400 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:40" (1/1) ... [2025-01-09 05:14:41,421 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:40" (1/1) ... [2025-01-09 05:14:41,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:40" (1/1) ... [2025-01-09 05:14:41,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:40" (1/1) ... [2025-01-09 05:14:41,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:40" (1/1) ... [2025-01-09 05:14:41,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:14:41,660 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:14:41,660 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:14:41,660 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:14:41,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:40" (1/1) ... [2025-01-09 05:14:41,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:14:41,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:14:41,687 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:14:41,690 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:14:41,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:14:41,723 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:14:41,723 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:14:41,723 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:14:41,723 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:14:41,723 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:14:41,723 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:14:41,723 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:14:41,723 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:14:41,723 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:14:41,723 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:14:41,723 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:14:41,723 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:14:41,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:14:41,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:14:41,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:14:41,835 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:14:41,837 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:14:48,686 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2025-01-09 05:14:48,687 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:14:48,734 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:14:48,738 INFO L312 CfgBuilder]: Removed 14 assume(true) statements. [2025-01-09 05:14:48,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:14:48 BoogieIcfgContainer [2025-01-09 05:14:48,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:14:48,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:14:48,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:14:48,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:14:48,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:14:38" (1/3) ... [2025-01-09 05:14:48,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51aff6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:14:48, skipping insertion in model container [2025-01-09 05:14:48,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:14:40" (2/3) ... [2025-01-09 05:14:48,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51aff6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:14:48, skipping insertion in model container [2025-01-09 05:14:48,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:14:48" (3/3) ... [2025-01-09 05:14:48,747 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.10.cil-2.c [2025-01-09 05:14:48,762 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:14:48,766 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label40+token_ring.10.cil-2.c that has 7 procedures, 2513 locations, 1 initial locations, 14 loop locations, and 2 error locations. [2025-01-09 05:14:48,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:14:48,888 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;@4ea57332, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:14:48,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:14:48,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 2513 states, 2481 states have (on average 1.8399838774687627) internal successors, (4565), 2483 states have internal predecessors, (4565), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 05:14:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:14:48,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:48,917 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] [2025-01-09 05:14:48,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:48,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:48,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1739200000, now seen corresponding path program 1 times [2025-01-09 05:14:48,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:48,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415036513] [2025-01-09 05:14:48,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:48,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:48,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:14:49,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:14:49,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:49,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:49,270 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:14:49,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:49,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415036513] [2025-01-09 05:14:49,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415036513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:49,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:49,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:14:49,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56333917] [2025-01-09 05:14:49,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:49,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:14:49,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:49,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:14:49,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:14:49,299 INFO L87 Difference]: Start difference. First operand has 2513 states, 2481 states have (on average 1.8399838774687627) internal successors, (4565), 2483 states have internal predecessors, (4565), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:14:49,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:49,447 INFO L93 Difference]: Finished difference Result 5015 states and 9205 transitions. [2025-01-09 05:14:49,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:14:49,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 154 [2025-01-09 05:14:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:49,467 INFO L225 Difference]: With dead ends: 5015 [2025-01-09 05:14:49,468 INFO L226 Difference]: Without dead ends: 2446 [2025-01-09 05:14:49,479 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:14:49,481 INFO L435 NwaCegarLoop]: 4536 mSDtfsCounter, 504 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 8558 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:14:49,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 8558 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:14:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2025-01-09 05:14:49,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2446. [2025-01-09 05:14:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 2414 states have (on average 1.8309859154929577) internal successors, (4420), 2416 states have internal predecessors, (4420), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 05:14:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 4468 transitions. [2025-01-09 05:14:49,591 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 4468 transitions. Word has length 154 [2025-01-09 05:14:49,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:49,592 INFO L471 AbstractCegarLoop]: Abstraction has 2446 states and 4468 transitions. [2025-01-09 05:14:49,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:14:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 4468 transitions. [2025-01-09 05:14:49,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:14:49,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:49,600 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] [2025-01-09 05:14:49,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:14:49,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:49,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2145156930, now seen corresponding path program 1 times [2025-01-09 05:14:49,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:49,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230172545] [2025-01-09 05:14:49,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:49,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:49,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:14:49,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:14:49,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:49,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:50,023 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:14:50,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:50,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230172545] [2025-01-09 05:14:50,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230172545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:50,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:50,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:50,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857610986] [2025-01-09 05:14:50,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:50,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:50,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:50,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:50,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:50,027 INFO L87 Difference]: Start difference. First operand 2446 states and 4468 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:14:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:50,792 INFO L93 Difference]: Finished difference Result 3124 states and 5561 transitions. [2025-01-09 05:14:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:50,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:14:50,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:50,808 INFO L225 Difference]: With dead ends: 3124 [2025-01-09 05:14:50,809 INFO L226 Difference]: Without dead ends: 2817 [2025-01-09 05:14:50,812 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:14:50,812 INFO L435 NwaCegarLoop]: 4626 mSDtfsCounter, 4942 mSDsluCounter, 14038 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4960 SdHoareTripleChecker+Valid, 18664 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:50,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4960 Valid, 18664 Invalid, 1002 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:14:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2025-01-09 05:14:50,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2771. [2025-01-09 05:14:50,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2771 states, 2710 states have (on average 1.8055350553505536) internal successors, (4893), 2714 states have internal predecessors, (4893), 45 states have call successors, (45), 12 states have call predecessors, (45), 14 states have return successors, (52), 46 states have call predecessors, (52), 45 states have call successors, (52) [2025-01-09 05:14:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 4990 transitions. [2025-01-09 05:14:50,990 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 4990 transitions. Word has length 154 [2025-01-09 05:14:50,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:50,991 INFO L471 AbstractCegarLoop]: Abstraction has 2771 states and 4990 transitions. [2025-01-09 05:14:50,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:14:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 4990 transitions. [2025-01-09 05:14:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:14:50,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:50,996 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] [2025-01-09 05:14:50,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:14:50,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:50,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:50,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1860990976, now seen corresponding path program 1 times [2025-01-09 05:14:50,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:50,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086604937] [2025-01-09 05:14:50,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:50,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:51,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:14:51,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:14:51,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:51,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:51,193 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:14:51,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:51,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086604937] [2025-01-09 05:14:51,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086604937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:51,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:51,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:51,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217815024] [2025-01-09 05:14:51,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:51,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:51,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:51,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:51,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:51,197 INFO L87 Difference]: Start difference. First operand 2771 states and 4990 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:14:51,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:51,823 INFO L93 Difference]: Finished difference Result 4106 states and 7142 transitions. [2025-01-09 05:14:51,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:51,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:14:51,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:51,837 INFO L225 Difference]: With dead ends: 4106 [2025-01-09 05:14:51,837 INFO L226 Difference]: Without dead ends: 3476 [2025-01-09 05:14:51,839 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:14:51,840 INFO L435 NwaCegarLoop]: 4543 mSDtfsCounter, 4938 mSDsluCounter, 13828 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4956 SdHoareTripleChecker+Valid, 18371 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:51,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4956 Valid, 18371 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:14:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2025-01-09 05:14:51,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3411. [2025-01-09 05:14:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3411 states, 3296 states have (on average 1.7675970873786409) internal successors, (5826), 3304 states have internal predecessors, (5826), 83 states have call successors, (83), 24 states have call predecessors, (83), 30 states have return successors, (106), 86 states have call predecessors, (106), 83 states have call successors, (106) [2025-01-09 05:14:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 6015 transitions. [2025-01-09 05:14:51,920 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 6015 transitions. Word has length 154 [2025-01-09 05:14:51,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:51,921 INFO L471 AbstractCegarLoop]: Abstraction has 3411 states and 6015 transitions. [2025-01-09 05:14:51,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:14:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 6015 transitions. [2025-01-09 05:14:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:14:51,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:51,923 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] [2025-01-09 05:14:51,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:14:51,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:51,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:51,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1889103746, now seen corresponding path program 1 times [2025-01-09 05:14:51,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:51,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147073099] [2025-01-09 05:14:51,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:51,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:51,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:14:51,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:14:51,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:51,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:52,052 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:14:52,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:52,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147073099] [2025-01-09 05:14:52,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147073099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:52,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:52,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:52,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213694145] [2025-01-09 05:14:52,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:52,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:52,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:52,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:52,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:52,054 INFO L87 Difference]: Start difference. First operand 3411 states and 6015 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:14:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:53,025 INFO L93 Difference]: Finished difference Result 6179 states and 10529 transitions. [2025-01-09 05:14:53,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:53,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:14:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:53,043 INFO L225 Difference]: With dead ends: 6179 [2025-01-09 05:14:53,044 INFO L226 Difference]: Without dead ends: 4909 [2025-01-09 05:14:53,048 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:14:53,048 INFO L435 NwaCegarLoop]: 4618 mSDtfsCounter, 4932 mSDsluCounter, 14002 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4950 SdHoareTripleChecker+Valid, 18620 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:53,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4950 Valid, 18620 Invalid, 999 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:14:53,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4909 states. [2025-01-09 05:14:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4909 to 4807. [2025-01-09 05:14:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4807 states, 4578 states have (on average 1.726518130187855) internal successors, (7904), 4600 states have internal predecessors, (7904), 159 states have call successors, (159), 48 states have call predecessors, (159), 68 states have return successors, (238), 166 states have call predecessors, (238), 159 states have call successors, (238) [2025-01-09 05:14:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4807 states to 4807 states and 8301 transitions. [2025-01-09 05:14:53,159 INFO L78 Accepts]: Start accepts. Automaton has 4807 states and 8301 transitions. Word has length 154 [2025-01-09 05:14:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:53,159 INFO L471 AbstractCegarLoop]: Abstraction has 4807 states and 8301 transitions. [2025-01-09 05:14:53,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:14:53,159 INFO L276 IsEmpty]: Start isEmpty. Operand 4807 states and 8301 transitions. [2025-01-09 05:14:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:14:53,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:53,162 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] [2025-01-09 05:14:53,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:14:53,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:53,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:53,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1730703424, now seen corresponding path program 1 times [2025-01-09 05:14:53,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:53,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247702369] [2025-01-09 05:14:53,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:53,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:53,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:14:53,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:14:53,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:53,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:53,318 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:14:53,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:53,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247702369] [2025-01-09 05:14:53,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247702369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:53,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:53,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:53,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262189570] [2025-01-09 05:14:53,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:53,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:53,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:53,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:53,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:53,320 INFO L87 Difference]: Start difference. First operand 4807 states and 8301 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:14:54,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:54,496 INFO L93 Difference]: Finished difference Result 10770 states and 18235 transitions. [2025-01-09 05:14:54,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:54,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:14:54,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:54,530 INFO L225 Difference]: With dead ends: 10770 [2025-01-09 05:14:54,530 INFO L226 Difference]: Without dead ends: 8104 [2025-01-09 05:14:54,541 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:14:54,542 INFO L435 NwaCegarLoop]: 4615 mSDtfsCounter, 4927 mSDsluCounter, 13989 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4945 SdHoareTripleChecker+Valid, 18604 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:54,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4945 Valid, 18604 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 05:14:54,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8104 states. [2025-01-09 05:14:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8104 to 7931. [2025-01-09 05:14:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7931 states, 7456 states have (on average 1.698766094420601) internal successors, (12666), 7524 states have internal predecessors, (12666), 311 states have call successors, (311), 96 states have call predecessors, (311), 162 states have return successors, (598), 326 states have call predecessors, (598), 311 states have call successors, (598) [2025-01-09 05:14:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7931 states to 7931 states and 13575 transitions. [2025-01-09 05:14:54,810 INFO L78 Accepts]: Start accepts. Automaton has 7931 states and 13575 transitions. Word has length 154 [2025-01-09 05:14:54,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:54,810 INFO L471 AbstractCegarLoop]: Abstraction has 7931 states and 13575 transitions. [2025-01-09 05:14:54,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:14:54,811 INFO L276 IsEmpty]: Start isEmpty. Operand 7931 states and 13575 transitions. [2025-01-09 05:14:54,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:14:54,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:54,817 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] [2025-01-09 05:14:54,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:14:54,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:54,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:54,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1616211906, now seen corresponding path program 1 times [2025-01-09 05:14:54,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:54,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472009178] [2025-01-09 05:14:54,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:54,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:54,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:14:54,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:14:54,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:54,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:54,940 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:14:54,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:54,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472009178] [2025-01-09 05:14:54,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472009178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:54,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:54,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:54,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973516121] [2025-01-09 05:14:54,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:54,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:54,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:54,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:54,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:54,944 INFO L87 Difference]: Start difference. First operand 7931 states and 13575 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:14:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:55,787 INFO L93 Difference]: Finished difference Result 21221 states and 36437 transitions. [2025-01-09 05:14:55,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:55,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:14:55,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:55,857 INFO L225 Difference]: With dead ends: 21221 [2025-01-09 05:14:55,857 INFO L226 Difference]: Without dead ends: 15431 [2025-01-09 05:14:55,877 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:14:55,879 INFO L435 NwaCegarLoop]: 4613 mSDtfsCounter, 4922 mSDsluCounter, 13977 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4940 SdHoareTripleChecker+Valid, 18590 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:55,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4940 Valid, 18590 Invalid, 996 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:14:55,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15431 states. [2025-01-09 05:14:56,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15431 to 15123. [2025-01-09 05:14:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15123 states, 14102 states have (on average 1.6953623599489434) internal successors, (23908), 14316 states have internal predecessors, (23908), 615 states have call successors, (615), 192 states have call predecessors, (615), 404 states have return successors, (1702), 646 states have call predecessors, (1702), 615 states have call successors, (1702) [2025-01-09 05:14:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15123 states to 15123 states and 26225 transitions. [2025-01-09 05:14:56,489 INFO L78 Accepts]: Start accepts. Automaton has 15123 states and 26225 transitions. Word has length 154 [2025-01-09 05:14:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:56,494 INFO L471 AbstractCegarLoop]: Abstraction has 15123 states and 26225 transitions. [2025-01-09 05:14:56,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:14:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 15123 states and 26225 transitions. [2025-01-09 05:14:56,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:14:56,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:56,517 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] [2025-01-09 05:14:56,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:14:56,517 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:56,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:56,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1031440256, now seen corresponding path program 1 times [2025-01-09 05:14:56,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:56,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60671070] [2025-01-09 05:14:56,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:56,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:56,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:14:56,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:14:56,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:56,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:56,793 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:14:56,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:56,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60671070] [2025-01-09 05:14:56,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60671070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:56,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:56,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:56,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619247842] [2025-01-09 05:14:56,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:56,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:56,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:56,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:56,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:56,797 INFO L87 Difference]: Start difference. First operand 15123 states and 26225 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:14:58,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:58,128 INFO L93 Difference]: Finished difference Result 45724 states and 81291 transitions. [2025-01-09 05:14:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:58,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:14:58,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:58,408 INFO L225 Difference]: With dead ends: 45724 [2025-01-09 05:14:58,409 INFO L226 Difference]: Without dead ends: 32742 [2025-01-09 05:14:58,446 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:14:58,448 INFO L435 NwaCegarLoop]: 4611 mSDtfsCounter, 4917 mSDsluCounter, 13965 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4935 SdHoareTripleChecker+Valid, 18576 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:58,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4935 Valid, 18576 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:14:58,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32742 states. [2025-01-09 05:14:59,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32742 to 32179. [2025-01-09 05:14:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32179 states, 29904 states have (on average 1.713282504012841) internal successors, (51234), 30572 states have internal predecessors, (51234), 1223 states have call successors, (1223), 384 states have call predecessors, (1223), 1050 states have return successors, (5446), 1286 states have call predecessors, (5446), 1223 states have call successors, (5446) [2025-01-09 05:15:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32179 states to 32179 states and 57903 transitions. [2025-01-09 05:15:00,088 INFO L78 Accepts]: Start accepts. Automaton has 32179 states and 57903 transitions. Word has length 154 [2025-01-09 05:15:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:00,088 INFO L471 AbstractCegarLoop]: Abstraction has 32179 states and 57903 transitions. [2025-01-09 05:15:00,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:15:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 32179 states and 57903 transitions. [2025-01-09 05:15:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:15:00,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:00,104 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] [2025-01-09 05:15:00,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:15:00,105 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:00,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:00,106 INFO L85 PathProgramCache]: Analyzing trace with hash 596934658, now seen corresponding path program 1 times [2025-01-09 05:15:00,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:00,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384002999] [2025-01-09 05:15:00,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:00,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:00,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:15:00,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:15:00,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:00,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:00,243 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:15:00,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:00,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384002999] [2025-01-09 05:15:00,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384002999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:00,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:00,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:15:00,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837156062] [2025-01-09 05:15:00,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:00,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:15:00,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:00,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:15:00,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:15:00,247 INFO L87 Difference]: Start difference. First operand 32179 states and 57903 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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:15:01,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:01,498 INFO L93 Difference]: Finished difference Result 73883 states and 137312 transitions. [2025-01-09 05:15:01,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:15:01,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:15:01,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:01,678 INFO L225 Difference]: With dead ends: 73883 [2025-01-09 05:15:01,679 INFO L226 Difference]: Without dead ends: 43843 [2025-01-09 05:15:01,910 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:15:01,911 INFO L435 NwaCegarLoop]: 4330 mSDtfsCounter, 4644 mSDsluCounter, 8525 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4662 SdHoareTripleChecker+Valid, 12855 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:01,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4662 Valid, 12855 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:15:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43843 states. [2025-01-09 05:15:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43843 to 32179. [2025-01-09 05:15:03,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32179 states, 29904 states have (on average 1.7111088817549491) internal successors, (51169), 30572 states have internal predecessors, (51169), 1223 states have call successors, (1223), 384 states have call predecessors, (1223), 1050 states have return successors, (5446), 1286 states have call predecessors, (5446), 1223 states have call successors, (5446) [2025-01-09 05:15:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32179 states to 32179 states and 57838 transitions. [2025-01-09 05:15:03,969 INFO L78 Accepts]: Start accepts. Automaton has 32179 states and 57838 transitions. Word has length 154 [2025-01-09 05:15:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:03,971 INFO L471 AbstractCegarLoop]: Abstraction has 32179 states and 57838 transitions. [2025-01-09 05:15:03,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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:15:03,971 INFO L276 IsEmpty]: Start isEmpty. Operand 32179 states and 57838 transitions. [2025-01-09 05:15:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:15:03,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:03,985 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] [2025-01-09 05:15:03,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:15:03,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:03,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:03,986 INFO L85 PathProgramCache]: Analyzing trace with hash 167276352, now seen corresponding path program 1 times [2025-01-09 05:15:03,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:03,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930364492] [2025-01-09 05:15:03,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:03,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:03,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:15:04,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:15:04,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:04,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:04,122 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:15:04,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:04,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930364492] [2025-01-09 05:15:04,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930364492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:04,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:04,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:04,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540747] [2025-01-09 05:15:04,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:04,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:04,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:04,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:04,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:04,125 INFO L87 Difference]: Start difference. First operand 32179 states and 57838 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:15:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:06,285 INFO L93 Difference]: Finished difference Result 103317 states and 193667 transitions. [2025-01-09 05:15:06,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:06,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:15:06,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:06,565 INFO L225 Difference]: With dead ends: 103317 [2025-01-09 05:15:06,565 INFO L226 Difference]: Without dead ends: 73279 [2025-01-09 05:15:06,639 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:15:06,642 INFO L435 NwaCegarLoop]: 4600 mSDtfsCounter, 4901 mSDsluCounter, 13920 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4919 SdHoareTripleChecker+Valid, 18520 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:06,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4919 Valid, 18520 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:15:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73279 states. [2025-01-09 05:15:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73279 to 72367. [2025-01-09 05:15:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72367 states, 67098 states have (on average 1.7350591671882918) internal successors, (116419), 69160 states have internal predecessors, (116419), 2439 states have call successors, (2439), 768 states have call predecessors, (2439), 2828 states have return successors, (19078), 2566 states have call predecessors, (19078), 2439 states have call successors, (19078) [2025-01-09 05:15:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72367 states to 72367 states and 137936 transitions. [2025-01-09 05:15:09,775 INFO L78 Accepts]: Start accepts. Automaton has 72367 states and 137936 transitions. Word has length 154 [2025-01-09 05:15:09,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:09,775 INFO L471 AbstractCegarLoop]: Abstraction has 72367 states and 137936 transitions. [2025-01-09 05:15:09,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:15:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 72367 states and 137936 transitions. [2025-01-09 05:15:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:15:09,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:09,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:15:09,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:15:09,802 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:09,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:09,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1114314238, now seen corresponding path program 1 times [2025-01-09 05:15:09,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:09,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652382527] [2025-01-09 05:15:09,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:09,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:09,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:15:09,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:15:09,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:09,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:09,935 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:15:09,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:09,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652382527] [2025-01-09 05:15:09,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652382527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:09,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:09,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:09,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096314770] [2025-01-09 05:15:09,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:09,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:09,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:09,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:09,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:09,937 INFO L87 Difference]: Start difference. First operand 72367 states and 137936 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:15:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:15,604 INFO L93 Difference]: Finished difference Result 242868 states and 492137 transitions. [2025-01-09 05:15:15,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:15,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:15:15,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:16,419 INFO L225 Difference]: With dead ends: 242868 [2025-01-09 05:15:16,419 INFO L226 Difference]: Without dead ends: 172642 [2025-01-09 05:15:16,577 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:15:16,578 INFO L435 NwaCegarLoop]: 4536 mSDtfsCounter, 4897 mSDsluCounter, 13769 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4915 SdHoareTripleChecker+Valid, 18305 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:16,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4915 Valid, 18305 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:15:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172642 states. [2025-01-09 05:15:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172642 to 170963. [2025-01-09 05:15:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170963 states, 158248 states have (on average 1.7625562408371669) internal successors, (278921), 164556 states have internal predecessors, (278921), 4871 states have call successors, (4871), 1536 states have call predecessors, (4871), 7842 states have return successors, (70918), 5126 states have call predecessors, (70918), 4871 states have call successors, (70918) [2025-01-09 05:15:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170963 states to 170963 states and 354710 transitions. [2025-01-09 05:15:26,493 INFO L78 Accepts]: Start accepts. Automaton has 170963 states and 354710 transitions. Word has length 154 [2025-01-09 05:15:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:26,494 INFO L471 AbstractCegarLoop]: Abstraction has 170963 states and 354710 transitions. [2025-01-09 05:15:26,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:15:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand 170963 states and 354710 transitions. [2025-01-09 05:15:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:15:26,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:26,543 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] [2025-01-09 05:15:26,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:15:26,544 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:26,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1976147840, now seen corresponding path program 1 times [2025-01-09 05:15:26,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:26,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669628257] [2025-01-09 05:15:26,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:26,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:26,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:15:26,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:15:26,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:26,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:26,665 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:15:26,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:26,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669628257] [2025-01-09 05:15:26,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669628257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:26,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:26,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:26,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399538398] [2025-01-09 05:15:26,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:26,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:26,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:26,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:26,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:26,666 INFO L87 Difference]: Start difference. First operand 170963 states and 354710 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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)