./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec13_product29.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec13_product29.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 63ce65fdf446745f64534f105010543d07f1d807cf17249eadefb49fdfafb832 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:11:27,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:11:27,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:11:27,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:11:27,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:11:27,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:11:27,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:11:27,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:11:27,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:11:27,841 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:11:27,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:11:27,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:11:27,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:11:27,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:11:27,842 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:11:27,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:11:27,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:11:27,842 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:11:27,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:11:27,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:11:27,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:11:27,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:11:27,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:11:27,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:11:27,843 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:11:27,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:11:27,843 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:11:27,843 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:11:27,843 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:11:27,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:11:27,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:11:27,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:11:27,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:11:27,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:11:27,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:11:27,843 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:11:27,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:11:27,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:11:27,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:11:27,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:11:27,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:11:27,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:11:27,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:11:27,844 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/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 -> 63ce65fdf446745f64534f105010543d07f1d807cf17249eadefb49fdfafb832 [2025-03-03 14:11:28,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:11:28,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:11:28,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:11:28,064 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:11:28,064 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:11:28,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec13_product29.cil.c [2025-03-03 14:11:29,151 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66ef32301/f955c1a0649c4a2bb9ccc7f1c4ab4a5d/FLAGaf1eec52b [2025-03-03 14:11:29,449 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:11:29,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec13_product29.cil.c [2025-03-03 14:11:29,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66ef32301/f955c1a0649c4a2bb9ccc7f1c4ab4a5d/FLAGaf1eec52b [2025-03-03 14:11:29,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66ef32301/f955c1a0649c4a2bb9ccc7f1c4ab4a5d [2025-03-03 14:11:29,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:11:29,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:11:29,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:11:29,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:11:29,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:11:29,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:11:29" (1/1) ... [2025-03-03 14:11:29,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44ce9961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:29, skipping insertion in model container [2025-03-03 14:11:29,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:11:29" (1/1) ... [2025-03-03 14:11:29,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:11:30,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec13_product29.cil.c[54440,54453] [2025-03-03 14:11:30,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:11:30,088 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:11:30,093 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2025-03-03 14:11:30,094 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [716] [2025-03-03 14:11:30,094 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [736] [2025-03-03 14:11:30,094 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [857] [2025-03-03 14:11:30,094 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification13_spec.i","") [2398] [2025-03-03 14:11:30,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2488] [2025-03-03 14:11:30,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2497] [2025-03-03 14:11:30,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2589] [2025-03-03 14:11:30,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2940] [2025-03-03 14:11:30,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2975] [2025-03-03 14:11:30,159 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec13_product29.cil.c[54440,54453] [2025-03-03 14:11:30,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:11:30,206 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:11:30,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:30 WrapperNode [2025-03-03 14:11:30,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:11:30,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:11:30,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:11:30,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:11:30,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:30" (1/1) ... [2025-03-03 14:11:30,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:30" (1/1) ... [2025-03-03 14:11:30,264 INFO L138 Inliner]: procedures = 91, calls = 340, calls flagged for inlining = 28, calls inlined = 25, statements flattened = 858 [2025-03-03 14:11:30,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:11:30,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:11:30,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:11:30,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:11:30,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:30" (1/1) ... [2025-03-03 14:11:30,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:30" (1/1) ... [2025-03-03 14:11:30,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:30" (1/1) ... [2025-03-03 14:11:30,300 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-03 14:11:30,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:30" (1/1) ... [2025-03-03 14:11:30,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:30" (1/1) ... [2025-03-03 14:11:30,323 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:30" (1/1) ... [2025-03-03 14:11:30,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:30" (1/1) ... [2025-03-03 14:11:30,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:30" (1/1) ... [2025-03-03 14:11:30,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:30" (1/1) ... [2025-03-03 14:11:30,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:11:30,342 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:11:30,343 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:11:30,343 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:11:30,343 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:30" (1/1) ... [2025-03-03 14:11:30,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:11:30,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:30,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:11:30,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:11:30,384 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2025-03-03 14:11:30,385 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2025-03-03 14:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-03-03 14:11:30,385 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-03-03 14:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:11:30,385 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2025-03-03 14:11:30,385 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2025-03-03 14:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:11:30,385 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:11:30,385 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-03 14:11:30,385 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-03 14:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:11:30,385 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-03-03 14:11:30,385 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-03-03 14:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:11:30,385 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:11:30,385 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:11:30,385 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:11:30,385 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:11:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:11:30,385 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:11:30,386 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:11:30,386 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:11:30,386 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:11:30,386 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:11:30,386 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:11:30,386 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:11:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:11:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:11:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:11:30,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:11:30,389 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-03 14:11:30,389 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-03 14:11:30,389 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:11:30,389 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:11:30,390 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:11:30,390 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:11:30,390 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:11:30,390 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:11:30,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:11:30,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:11:30,390 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:11:30,390 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:11:30,526 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:11:30,528 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:11:30,563 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1164: #res := ~retValue_acc~10; [2025-03-03 14:11:30,586 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L854: #res := ~retValue_acc~5; [2025-03-03 14:11:30,610 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L776: #res := ~retValue_acc~3; [2025-03-03 14:11:30,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L939: #res := ~retValue_acc~6; [2025-03-03 14:11:30,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2395: #res := ~retValue_acc~20; [2025-03-03 14:11:30,867 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1722-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~16#1; [2025-03-03 14:11:30,867 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1688: #res#1 := ~retValue_acc~15#1; [2025-03-03 14:11:30,923 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820: #res := ~retValue_acc~19; [2025-03-03 14:11:30,933 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L815: #res := ~retValue_acc~4; [2025-03-03 14:11:31,060 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1649: #res := ~retValue_acc~14; [2025-03-03 14:11:31,069 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1155: #res := ~retValue_acc~9; [2025-03-03 14:11:31,108 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1204-1: isEmpty_#res#1 := isEmpty_~retValue_acc~11#1; [2025-03-03 14:11:31,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1778-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~17#1; [2025-03-03 14:11:31,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1112-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~7#1; [2025-03-03 14:11:31,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~18#1; [2025-03-03 14:11:31,264 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1284-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~12#1; [2025-03-03 14:11:31,264 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1297-1: isIdle_#res#1 := isIdle_~retValue_acc~13#1; [2025-03-03 14:11:31,305 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L402: #res := ~retValue_acc~1; [2025-03-03 14:11:31,354 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2972-1: valid_product_#res#1 := valid_product_~retValue_acc~24#1; [2025-03-03 14:11:31,355 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2937-1: main_#res#1 := main_~retValue_acc~22#1; [2025-03-03 14:11:31,365 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: #res := ~retValue_acc~0; [2025-03-03 14:11:31,368 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: #res := ~retValue_acc~2; [2025-03-03 14:11:31,479 INFO L? ?]: Removed 471 outVars from TransFormulas that were not future-live. [2025-03-03 14:11:31,479 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:11:31,497 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:11:31,497 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:11:31,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:11:31 BoogieIcfgContainer [2025-03-03 14:11:31,497 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:11:31,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:11:31,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:11:31,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:11:31,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:11:29" (1/3) ... [2025-03-03 14:11:31,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b352472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:11:31, skipping insertion in model container [2025-03-03 14:11:31,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:30" (2/3) ... [2025-03-03 14:11:31,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b352472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:11:31, skipping insertion in model container [2025-03-03 14:11:31,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:11:31" (3/3) ... [2025-03-03 14:11:31,503 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec13_product29.cil.c [2025-03-03 14:11:31,518 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:11:31,521 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec13_product29.cil.c that has 26 procedures, 599 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-03 14:11:31,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:11:31,579 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;@77dce686, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:11:31,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:11:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 599 states, 472 states have (on average 1.6885593220338984) internal successors, (797), 490 states have internal predecessors, (797), 100 states have call successors, (100), 25 states have call predecessors, (100), 25 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 14:11:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:11:31,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:31,609 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:31,610 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:31,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:31,616 INFO L85 PathProgramCache]: Analyzing trace with hash -642004530, now seen corresponding path program 1 times [2025-03-03 14:11:31,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:31,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331684497] [2025-03-03 14:11:31,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:31,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:31,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:11:31,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:11:31,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:31,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:11:32,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:32,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331684497] [2025-03-03 14:11:32,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331684497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:32,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763516525] [2025-03-03 14:11:32,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:32,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:32,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:32,101 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:32,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:11:32,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:11:32,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:11:32,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:32,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:32,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:11:32,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 14:11:32,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:32,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763516525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:32,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:32,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:11:32,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779111061] [2025-03-03 14:11:32,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:32,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:32,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:32,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:32,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:11:32,486 INFO L87 Difference]: Start difference. First operand has 599 states, 472 states have (on average 1.6885593220338984) internal successors, (797), 490 states have internal predecessors, (797), 100 states have call successors, (100), 25 states have call predecessors, (100), 25 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:11:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:32,634 INFO L93 Difference]: Finished difference Result 1197 states and 2010 transitions. [2025-03-03 14:11:32,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:11:32,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2025-03-03 14:11:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:32,647 INFO L225 Difference]: With dead ends: 1197 [2025-03-03 14:11:32,648 INFO L226 Difference]: Without dead ends: 598 [2025-03-03 14:11:32,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:11:32,658 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 17 mSDsluCounter, 1944 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2920 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:32,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2920 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-03-03 14:11:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2025-03-03 14:11:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 473 states have (on average 1.6807610993657505) internal successors, (795), 489 states have internal predecessors, (795), 100 states have call successors, (100), 26 states have call predecessors, (100), 24 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:11:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 992 transitions. [2025-03-03 14:11:32,732 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 992 transitions. Word has length 114 [2025-03-03 14:11:32,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:32,732 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 992 transitions. [2025-03-03 14:11:32,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:11:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 992 transitions. [2025-03-03 14:11:32,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:11:32,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:32,739 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:32,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:11:32,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:11:32,940 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:32,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:32,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1904578702, now seen corresponding path program 1 times [2025-03-03 14:11:32,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:32,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035817993] [2025-03-03 14:11:32,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:32,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:32,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:11:32,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:11:32,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:32,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:11:33,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:33,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035817993] [2025-03-03 14:11:33,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035817993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:33,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050827319] [2025-03-03 14:11:33,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:33,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:33,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:33,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:33,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:11:33,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:11:33,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:11:33,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:33,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:33,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1379 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:11:33,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:11:33,558 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:33,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050827319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:33,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:33,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-03 14:11:33,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927186942] [2025-03-03 14:11:33,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:33,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:33,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:33,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:33,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:11:33,560 INFO L87 Difference]: Start difference. First operand 598 states and 992 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:11:33,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:33,802 INFO L93 Difference]: Finished difference Result 1249 states and 2088 transitions. [2025-03-03 14:11:33,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:11:33,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2025-03-03 14:11:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:33,808 INFO L225 Difference]: With dead ends: 1249 [2025-03-03 14:11:33,809 INFO L226 Difference]: Without dead ends: 661 [2025-03-03 14:11:33,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:11:33,813 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 122 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 2782 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:33,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 2782 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:11:33,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-03-03 14:11:33,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 643. [2025-03-03 14:11:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 517 states have (on average 1.700193423597679) internal successors, (879), 533 states have internal predecessors, (879), 100 states have call successors, (100), 27 states have call predecessors, (100), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:11:33,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1076 transitions. [2025-03-03 14:11:33,856 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1076 transitions. Word has length 116 [2025-03-03 14:11:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:33,857 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 1076 transitions. [2025-03-03 14:11:33,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:11:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1076 transitions. [2025-03-03 14:11:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:11:33,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:33,863 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:33,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:34,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:11:34,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:34,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash -101492286, now seen corresponding path program 1 times [2025-03-03 14:11:34,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:34,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879580953] [2025-03-03 14:11:34,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:34,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:34,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:11:34,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:11:34,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:34,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:11:34,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:34,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879580953] [2025-03-03 14:11:34,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879580953] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:34,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79240343] [2025-03-03 14:11:34,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:34,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:34,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:34,320 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:34,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:11:34,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:11:34,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:11:34,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:34,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:34,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:11:34,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:11:34,603 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:34,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79240343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:34,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:34,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-03 14:11:34,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793809150] [2025-03-03 14:11:34,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:34,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:11:34,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:34,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:11:34,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:11:34,604 INFO L87 Difference]: Start difference. First operand 643 states and 1076 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:34,716 INFO L93 Difference]: Finished difference Result 1301 states and 2179 transitions. [2025-03-03 14:11:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:11:34,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 118 [2025-03-03 14:11:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:34,721 INFO L225 Difference]: With dead ends: 1301 [2025-03-03 14:11:34,721 INFO L226 Difference]: Without dead ends: 668 [2025-03-03 14:11:34,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:11:34,725 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 89 mSDsluCounter, 4736 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 5702 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:34,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 5702 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:34,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-03 14:11:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 656. [2025-03-03 14:11:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 527 states have (on average 1.6963946869070208) internal successors, (894), 545 states have internal predecessors, (894), 101 states have call successors, (101), 27 states have call predecessors, (101), 27 states have return successors, (102), 96 states have call predecessors, (102), 98 states have call successors, (102) [2025-03-03 14:11:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1097 transitions. [2025-03-03 14:11:34,756 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1097 transitions. Word has length 118 [2025-03-03 14:11:34,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:34,756 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 1097 transitions. [2025-03-03 14:11:34,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:34,757 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1097 transitions. [2025-03-03 14:11:34,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:11:34,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:34,760 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:34,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:34,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:34,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:34,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:34,961 INFO L85 PathProgramCache]: Analyzing trace with hash -982478307, now seen corresponding path program 1 times [2025-03-03 14:11:34,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:34,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180360686] [2025-03-03 14:11:34,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:34,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:34,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:11:34,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:11:34,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:34,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:11:35,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:35,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180360686] [2025-03-03 14:11:35,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180360686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633863178] [2025-03-03 14:11:35,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:35,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:35,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:35,049 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:35,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:11:35,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:11:35,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:11:35,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:35,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:35,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 1382 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:11:35,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:11:35,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:35,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633863178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:35,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:35,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:11:35,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350002977] [2025-03-03 14:11:35,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:35,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:35,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:35,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:35,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:11:35,303 INFO L87 Difference]: Start difference. First operand 656 states and 1097 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:11:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:35,395 INFO L93 Difference]: Finished difference Result 1315 states and 2200 transitions. [2025-03-03 14:11:35,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:11:35,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2025-03-03 14:11:35,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:35,399 INFO L225 Difference]: With dead ends: 1315 [2025-03-03 14:11:35,399 INFO L226 Difference]: Without dead ends: 667 [2025-03-03 14:11:35,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:11:35,404 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 12 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2889 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:35,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2889 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:35,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-03 14:11:35,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2025-03-03 14:11:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 535 states have (on average 1.6878504672897197) internal successors, (903), 553 states have internal predecessors, (903), 101 states have call successors, (101), 28 states have call predecessors, (101), 28 states have return successors, (101), 96 states have call predecessors, (101), 98 states have call successors, (101) [2025-03-03 14:11:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1105 transitions. [2025-03-03 14:11:35,432 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1105 transitions. Word has length 119 [2025-03-03 14:11:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:35,432 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 1105 transitions. [2025-03-03 14:11:35,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:11:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1105 transitions. [2025-03-03 14:11:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:11:35,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:35,436 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:35,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:35,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:35,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:35,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:35,640 INFO L85 PathProgramCache]: Analyzing trace with hash 757787155, now seen corresponding path program 1 times [2025-03-03 14:11:35,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:35,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213175535] [2025-03-03 14:11:35,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:35,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:35,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:11:35,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:11:35,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:35,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:11:35,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:35,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213175535] [2025-03-03 14:11:35,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213175535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:35,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618898130] [2025-03-03 14:11:35,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:35,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:35,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:35,777 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:35,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:11:35,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:11:35,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:11:35,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:35,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:35,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 1382 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:11:35,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:11:36,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:36,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618898130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:36,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:36,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-03 14:11:36,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248467283] [2025-03-03 14:11:36,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:36,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:11:36,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:36,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:11:36,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:11:36,053 INFO L87 Difference]: Start difference. First operand 665 states and 1105 transitions. Second operand has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:36,144 INFO L93 Difference]: Finished difference Result 1330 states and 2213 transitions. [2025-03-03 14:11:36,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:11:36,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 119 [2025-03-03 14:11:36,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:36,148 INFO L225 Difference]: With dead ends: 1330 [2025-03-03 14:11:36,148 INFO L226 Difference]: Without dead ends: 688 [2025-03-03 14:11:36,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:11:36,152 INFO L435 NwaCegarLoop]: 965 mSDtfsCounter, 100 mSDsluCounter, 4721 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 5686 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:36,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 5686 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-03 14:11:36,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 665. [2025-03-03 14:11:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 535 states have (on average 1.6878504672897197) internal successors, (903), 553 states have internal predecessors, (903), 101 states have call successors, (101), 28 states have call predecessors, (101), 28 states have return successors, (101), 96 states have call predecessors, (101), 98 states have call successors, (101) [2025-03-03 14:11:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1105 transitions. [2025-03-03 14:11:36,174 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1105 transitions. Word has length 119 [2025-03-03 14:11:36,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:36,174 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 1105 transitions. [2025-03-03 14:11:36,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1105 transitions. [2025-03-03 14:11:36,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:11:36,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:36,177 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:36,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:36,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:36,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:36,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:36,378 INFO L85 PathProgramCache]: Analyzing trace with hash 307783588, now seen corresponding path program 1 times [2025-03-03 14:11:36,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:36,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78572714] [2025-03-03 14:11:36,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:36,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:36,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:11:36,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:11:36,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:36,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:11:36,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:36,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78572714] [2025-03-03 14:11:36,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78572714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:36,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484415629] [2025-03-03 14:11:36,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:36,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:36,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:36,529 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:36,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:11:36,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:11:36,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:11:36,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:36,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:36,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:11:36,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:11:36,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:36,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484415629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:36,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:36,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-03 14:11:36,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513070445] [2025-03-03 14:11:36,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:36,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:11:36,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:36,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:11:36,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:11:36,799 INFO L87 Difference]: Start difference. First operand 665 states and 1105 transitions. Second operand has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:36,891 INFO L93 Difference]: Finished difference Result 1330 states and 2213 transitions. [2025-03-03 14:11:36,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:11:36,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 120 [2025-03-03 14:11:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:36,895 INFO L225 Difference]: With dead ends: 1330 [2025-03-03 14:11:36,895 INFO L226 Difference]: Without dead ends: 688 [2025-03-03 14:11:36,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:11:36,899 INFO L435 NwaCegarLoop]: 965 mSDtfsCounter, 111 mSDsluCounter, 4709 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 5674 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:36,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 5674 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:36,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-03 14:11:36,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 665. [2025-03-03 14:11:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 535 states have (on average 1.6878504672897197) internal successors, (903), 553 states have internal predecessors, (903), 101 states have call successors, (101), 28 states have call predecessors, (101), 28 states have return successors, (101), 96 states have call predecessors, (101), 98 states have call successors, (101) [2025-03-03 14:11:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1105 transitions. [2025-03-03 14:11:36,920 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1105 transitions. Word has length 120 [2025-03-03 14:11:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:36,920 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 1105 transitions. [2025-03-03 14:11:36,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:36,920 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1105 transitions. [2025-03-03 14:11:36,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:11:36,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:36,924 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:36,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:11:37,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:37,124 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:37,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:37,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1950491717, now seen corresponding path program 1 times [2025-03-03 14:11:37,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:37,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799744631] [2025-03-03 14:11:37,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:37,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:37,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:11:37,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:11:37,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:37,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:11:37,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:37,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799744631] [2025-03-03 14:11:37,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799744631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:37,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906972067] [2025-03-03 14:11:37,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:37,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:37,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:37,267 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:37,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:11:37,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:11:37,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:11:37,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:37,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:37,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 1379 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:11:37,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:11:37,591 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:37,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906972067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:37,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:37,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-03-03 14:11:37,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709500125] [2025-03-03 14:11:37,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:37,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:11:37,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:37,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:11:37,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:11:37,592 INFO L87 Difference]: Start difference. First operand 665 states and 1105 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:37,749 INFO L93 Difference]: Finished difference Result 1333 states and 2217 transitions. [2025-03-03 14:11:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:11:37,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 120 [2025-03-03 14:11:37,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:37,753 INFO L225 Difference]: With dead ends: 1333 [2025-03-03 14:11:37,753 INFO L226 Difference]: Without dead ends: 691 [2025-03-03 14:11:37,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:11:37,758 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 95 mSDsluCounter, 5633 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 6588 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:37,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 6588 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:37,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-03-03 14:11:37,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 665. [2025-03-03 14:11:37,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 535 states have (on average 1.6878504672897197) internal successors, (903), 553 states have internal predecessors, (903), 101 states have call successors, (101), 28 states have call predecessors, (101), 28 states have return successors, (101), 96 states have call predecessors, (101), 98 states have call successors, (101) [2025-03-03 14:11:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1105 transitions. [2025-03-03 14:11:37,785 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1105 transitions. Word has length 120 [2025-03-03 14:11:37,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:37,785 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 1105 transitions. [2025-03-03 14:11:37,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:37,786 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1105 transitions. [2025-03-03 14:11:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:11:37,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:37,789 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:37,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:37,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:37,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:37,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:37,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1859808230, now seen corresponding path program 1 times [2025-03-03 14:11:37,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:37,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983270252] [2025-03-03 14:11:37,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:37,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:38,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:11:38,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:11:38,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:38,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:11:38,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:38,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983270252] [2025-03-03 14:11:38,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983270252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:38,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762434782] [2025-03-03 14:11:38,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:38,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:38,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:38,118 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:38,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:11:38,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:11:38,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:11:38,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:38,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:38,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:11:38,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:11:38,395 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:38,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762434782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:38,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:38,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-03-03 14:11:38,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080872185] [2025-03-03 14:11:38,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:38,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:11:38,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:38,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:11:38,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:11:38,398 INFO L87 Difference]: Start difference. First operand 665 states and 1105 transitions. Second operand has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:38,536 INFO L93 Difference]: Finished difference Result 1333 states and 2217 transitions. [2025-03-03 14:11:38,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:11:38,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 121 [2025-03-03 14:11:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:38,540 INFO L225 Difference]: With dead ends: 1333 [2025-03-03 14:11:38,540 INFO L226 Difference]: Without dead ends: 691 [2025-03-03 14:11:38,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:11:38,544 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 105 mSDsluCounter, 5621 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 6576 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:38,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 6576 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-03-03 14:11:38,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 665. [2025-03-03 14:11:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 535 states have (on average 1.6878504672897197) internal successors, (903), 553 states have internal predecessors, (903), 101 states have call successors, (101), 28 states have call predecessors, (101), 28 states have return successors, (101), 96 states have call predecessors, (101), 98 states have call successors, (101) [2025-03-03 14:11:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1105 transitions. [2025-03-03 14:11:38,565 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1105 transitions. Word has length 121 [2025-03-03 14:11:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:38,566 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 1105 transitions. [2025-03-03 14:11:38,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1105 transitions. [2025-03-03 14:11:38,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:11:38,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:38,569 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:38,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 14:11:38,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 14:11:38,773 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:38,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:38,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1123912037, now seen corresponding path program 1 times [2025-03-03 14:11:38,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:38,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229606918] [2025-03-03 14:11:38,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:38,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:38,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:11:38,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:11:38,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:38,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:11:38,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:38,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229606918] [2025-03-03 14:11:38,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229606918] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:38,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590574371] [2025-03-03 14:11:38,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:38,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:38,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:38,841 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:38,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:11:38,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:11:39,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:11:39,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:39,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:39,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 1384 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:11:39,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:11:39,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:39,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590574371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:39,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:39,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:11:39,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865965068] [2025-03-03 14:11:39,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:39,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:39,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:39,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:39,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:11:39,083 INFO L87 Difference]: Start difference. First operand 665 states and 1105 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:11:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:39,135 INFO L93 Difference]: Finished difference Result 1296 states and 2162 transitions. [2025-03-03 14:11:39,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:11:39,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2025-03-03 14:11:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:39,139 INFO L225 Difference]: With dead ends: 1296 [2025-03-03 14:11:39,140 INFO L226 Difference]: Without dead ends: 665 [2025-03-03 14:11:39,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:11:39,144 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 20 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2883 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:39,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2883 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-03 14:11:39,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2025-03-03 14:11:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 535 states have (on average 1.6785046728971962) internal successors, (898), 553 states have internal predecessors, (898), 101 states have call successors, (101), 28 states have call predecessors, (101), 28 states have return successors, (101), 96 states have call predecessors, (101), 98 states have call successors, (101) [2025-03-03 14:11:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1100 transitions. [2025-03-03 14:11:39,162 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1100 transitions. Word has length 122 [2025-03-03 14:11:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:39,163 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 1100 transitions. [2025-03-03 14:11:39,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:11:39,163 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1100 transitions. [2025-03-03 14:11:39,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:11:39,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:39,166 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:39,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:39,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:39,367 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:39,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:39,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1581288200, now seen corresponding path program 1 times [2025-03-03 14:11:39,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:39,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142334417] [2025-03-03 14:11:39,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:39,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:39,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:11:39,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:11:39,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:39,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:11:39,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:39,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142334417] [2025-03-03 14:11:39,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142334417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:39,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792143722] [2025-03-03 14:11:39,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:39,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:39,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:39,435 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:39,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 14:11:39,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:11:39,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:11:39,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:39,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:39,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:11:39,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:11:39,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:39,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792143722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:39,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:39,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:11:39,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445554799] [2025-03-03 14:11:39,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:39,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:39,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:39,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:39,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:11:39,682 INFO L87 Difference]: Start difference. First operand 665 states and 1100 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:11:39,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:39,842 INFO L93 Difference]: Finished difference Result 1325 states and 2202 transitions. [2025-03-03 14:11:39,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:11:39,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-03-03 14:11:39,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:39,847 INFO L225 Difference]: With dead ends: 1325 [2025-03-03 14:11:39,847 INFO L226 Difference]: Without dead ends: 752 [2025-03-03 14:11:39,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:11:39,850 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 171 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 2755 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:39,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 2755 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:39,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-03-03 14:11:39,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 710. [2025-03-03 14:11:39,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 579 states have (on average 1.6960276338514682) internal successors, (982), 597 states have internal predecessors, (982), 101 states have call successors, (101), 29 states have call predecessors, (101), 29 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2025-03-03 14:11:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1183 transitions. [2025-03-03 14:11:39,870 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1183 transitions. Word has length 123 [2025-03-03 14:11:39,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:39,870 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1183 transitions. [2025-03-03 14:11:39,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:11:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1183 transitions. [2025-03-03 14:11:39,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:11:39,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:39,873 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:39,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:40,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 14:11:40,077 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:40,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:40,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1579964765, now seen corresponding path program 1 times [2025-03-03 14:11:40,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:40,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163186405] [2025-03-03 14:11:40,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:40,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:11:40,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:11:40,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:40,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:11:40,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:40,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163186405] [2025-03-03 14:11:40,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163186405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:40,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521625030] [2025-03-03 14:11:40,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:40,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:40,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:40,145 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:40,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 14:11:40,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:11:40,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:11:40,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:40,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:40,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 1386 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:11:40,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:11:40,414 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:40,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521625030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:40,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:40,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-03 14:11:40,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977323532] [2025-03-03 14:11:40,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:40,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:11:40,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:40,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:11:40,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:11:40,416 INFO L87 Difference]: Start difference. First operand 710 states and 1183 transitions. Second operand has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:40,504 INFO L93 Difference]: Finished difference Result 1318 states and 2189 transitions. [2025-03-03 14:11:40,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:11:40,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 124 [2025-03-03 14:11:40,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:40,509 INFO L225 Difference]: With dead ends: 1318 [2025-03-03 14:11:40,509 INFO L226 Difference]: Without dead ends: 745 [2025-03-03 14:11:40,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:11:40,512 INFO L435 NwaCegarLoop]: 968 mSDtfsCounter, 89 mSDsluCounter, 4750 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 5718 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:40,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 5718 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:40,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-03 14:11:40,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 723. [2025-03-03 14:11:40,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 589 states have (on average 1.6926994906621393) internal successors, (997), 609 states have internal predecessors, (997), 102 states have call successors, (102), 29 states have call predecessors, (102), 31 states have return successors, (103), 97 states have call predecessors, (103), 99 states have call successors, (103) [2025-03-03 14:11:40,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1202 transitions. [2025-03-03 14:11:40,532 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1202 transitions. Word has length 124 [2025-03-03 14:11:40,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:40,532 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1202 transitions. [2025-03-03 14:11:40,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1202 transitions. [2025-03-03 14:11:40,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:11:40,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:40,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:40,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 14:11:40,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 14:11:40,736 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:40,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:40,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2134293699, now seen corresponding path program 1 times [2025-03-03 14:11:40,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:40,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813262634] [2025-03-03 14:11:40,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:40,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:40,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:11:40,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:11:40,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:40,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:11:40,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:40,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813262634] [2025-03-03 14:11:40,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813262634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:40,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903746299] [2025-03-03 14:11:40,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:40,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:40,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:40,793 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:40,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 14:11:40,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:11:40,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:11:40,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:40,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:40,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:11:40,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:11:41,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:41,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903746299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:41,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:41,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:11:41,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725901391] [2025-03-03 14:11:41,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:41,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:41,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:41,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:41,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:11:41,016 INFO L87 Difference]: Start difference. First operand 723 states and 1202 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:11:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:41,067 INFO L93 Difference]: Finished difference Result 1372 states and 2285 transitions. [2025-03-03 14:11:41,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:11:41,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2025-03-03 14:11:41,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:41,070 INFO L225 Difference]: With dead ends: 1372 [2025-03-03 14:11:41,071 INFO L226 Difference]: Without dead ends: 723 [2025-03-03 14:11:41,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:11:41,073 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 2 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2892 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:41,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2892 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:41,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-03-03 14:11:41,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2025-03-03 14:11:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 589 states have (on average 1.6876061120543293) internal successors, (994), 609 states have internal predecessors, (994), 102 states have call successors, (102), 29 states have call predecessors, (102), 31 states have return successors, (103), 97 states have call predecessors, (103), 99 states have call successors, (103) [2025-03-03 14:11:41,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1199 transitions. [2025-03-03 14:11:41,090 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1199 transitions. Word has length 125 [2025-03-03 14:11:41,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:41,090 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1199 transitions. [2025-03-03 14:11:41,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:11:41,090 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1199 transitions. [2025-03-03 14:11:41,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:11:41,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:41,093 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:41,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:41,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 14:11:41,293 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:41,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:41,294 INFO L85 PathProgramCache]: Analyzing trace with hash -560397184, now seen corresponding path program 1 times [2025-03-03 14:11:41,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:41,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568772259] [2025-03-03 14:11:41,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:41,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:41,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:11:41,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:11:41,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:41,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 14:11:41,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:41,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568772259] [2025-03-03 14:11:41,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568772259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:41,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118038589] [2025-03-03 14:11:41,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:41,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:41,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:41,350 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:41,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 14:11:41,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:11:41,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:11:41,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:41,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:41,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:11:41,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:11:41,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:41,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118038589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:41,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:41,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-03 14:11:41,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888151568] [2025-03-03 14:11:41,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:41,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:11:41,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:41,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:11:41,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:11:41,594 INFO L87 Difference]: Start difference. First operand 723 states and 1199 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:41,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:41,665 INFO L93 Difference]: Finished difference Result 1327 states and 2200 transitions. [2025-03-03 14:11:41,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:11:41,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 125 [2025-03-03 14:11:41,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:41,669 INFO L225 Difference]: With dead ends: 1327 [2025-03-03 14:11:41,669 INFO L226 Difference]: Without dead ends: 754 [2025-03-03 14:11:41,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:11:41,671 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 100 mSDsluCounter, 4717 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 5680 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:41,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 5680 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-03 14:11:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 723. [2025-03-03 14:11:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 589 states have (on average 1.6876061120543293) internal successors, (994), 609 states have internal predecessors, (994), 102 states have call successors, (102), 29 states have call predecessors, (102), 31 states have return successors, (103), 97 states have call predecessors, (103), 99 states have call successors, (103) [2025-03-03 14:11:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1199 transitions. [2025-03-03 14:11:41,688 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1199 transitions. Word has length 125 [2025-03-03 14:11:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:41,688 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1199 transitions. [2025-03-03 14:11:41,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1199 transitions. [2025-03-03 14:11:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:11:41,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:41,691 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:41,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:41,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 14:11:41,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:41,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash -498155151, now seen corresponding path program 1 times [2025-03-03 14:11:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:41,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094255339] [2025-03-03 14:11:41,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:41,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:41,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:11:41,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:11:41,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:41,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 14:11:41,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:41,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094255339] [2025-03-03 14:11:41,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094255339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:41,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261911588] [2025-03-03 14:11:41,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:41,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:41,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:41,954 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:41,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 14:11:42,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:11:42,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:11:42,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:42,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:42,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:11:42,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:11:42,217 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:42,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261911588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:42,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:42,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-03-03 14:11:42,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650028708] [2025-03-03 14:11:42,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:42,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:11:42,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:42,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:11:42,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:11:42,218 INFO L87 Difference]: Start difference. First operand 723 states and 1199 transitions. Second operand has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:42,349 INFO L93 Difference]: Finished difference Result 1330 states and 2203 transitions. [2025-03-03 14:11:42,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:11:42,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 125 [2025-03-03 14:11:42,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:42,353 INFO L225 Difference]: With dead ends: 1330 [2025-03-03 14:11:42,354 INFO L226 Difference]: Without dead ends: 757 [2025-03-03 14:11:42,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:11:42,356 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 96 mSDsluCounter, 5627 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 6580 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:42,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 6580 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:42,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2025-03-03 14:11:42,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 723. [2025-03-03 14:11:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 589 states have (on average 1.6876061120543293) internal successors, (994), 609 states have internal predecessors, (994), 102 states have call successors, (102), 29 states have call predecessors, (102), 31 states have return successors, (103), 97 states have call predecessors, (103), 99 states have call successors, (103) [2025-03-03 14:11:42,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1199 transitions. [2025-03-03 14:11:42,373 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1199 transitions. Word has length 125 [2025-03-03 14:11:42,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:42,373 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1199 transitions. [2025-03-03 14:11:42,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1199 transitions. [2025-03-03 14:11:42,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:11:42,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:42,376 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:42,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 14:11:42,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:42,576 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:42,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:42,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1019161668, now seen corresponding path program 1 times [2025-03-03 14:11:42,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:42,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043697250] [2025-03-03 14:11:42,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:42,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:42,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:11:42,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:11:42,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:42,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 14:11:42,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:42,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043697250] [2025-03-03 14:11:42,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043697250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:42,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608146298] [2025-03-03 14:11:42,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:42,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:42,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:42,642 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:42,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 14:11:42,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:11:42,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:11:42,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:42,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:42,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 1384 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:11:42,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:42,920 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:11:42,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:42,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608146298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:42,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:42,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-03-03 14:11:42,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969931491] [2025-03-03 14:11:42,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:42,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:11:42,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:42,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:11:42,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:11:42,922 INFO L87 Difference]: Start difference. First operand 723 states and 1199 transitions. Second operand has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:43,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:43,023 INFO L93 Difference]: Finished difference Result 1321 states and 2189 transitions. [2025-03-03 14:11:43,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:11:43,023 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 126 [2025-03-03 14:11:43,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:43,028 INFO L225 Difference]: With dead ends: 1321 [2025-03-03 14:11:43,028 INFO L226 Difference]: Without dead ends: 748 [2025-03-03 14:11:43,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:11:43,031 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 106 mSDsluCounter, 5615 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 6568 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:43,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 6568 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2025-03-03 14:11:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 723. [2025-03-03 14:11:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 589 states have (on average 1.6876061120543293) internal successors, (994), 609 states have internal predecessors, (994), 102 states have call successors, (102), 29 states have call predecessors, (102), 31 states have return successors, (103), 97 states have call predecessors, (103), 99 states have call successors, (103) [2025-03-03 14:11:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1199 transitions. [2025-03-03 14:11:43,048 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1199 transitions. Word has length 126 [2025-03-03 14:11:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:43,048 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1199 transitions. [2025-03-03 14:11:43,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1199 transitions. [2025-03-03 14:11:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:11:43,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:43,051 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:43,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:43,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 14:11:43,252 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:43,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash 667104097, now seen corresponding path program 1 times [2025-03-03 14:11:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:43,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93818946] [2025-03-03 14:11:43,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:43,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:11:43,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:11:43,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:43,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:11:43,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:43,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93818946] [2025-03-03 14:11:43,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93818946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:43,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669608292] [2025-03-03 14:11:43,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:43,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:43,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:43,315 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:43,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 14:11:43,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:11:43,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:11:43,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:43,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:43,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:11:43,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:11:43,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:43,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669608292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:43,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:43,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-03 14:11:43,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500490991] [2025-03-03 14:11:43,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:43,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:43,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:43,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:43,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:43,561 INFO L87 Difference]: Start difference. First operand 723 states and 1199 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:11:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:43,595 INFO L93 Difference]: Finished difference Result 1423 states and 2372 transitions. [2025-03-03 14:11:43,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:11:43,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-03-03 14:11:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:43,599 INFO L225 Difference]: With dead ends: 1423 [2025-03-03 14:11:43,599 INFO L226 Difference]: Without dead ends: 688 [2025-03-03 14:11:43,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:11:43,601 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 7 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2884 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:43,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2884 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:43,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-03 14:11:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-03-03 14:11:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 557 states have (on average 1.6678635547576302) internal successors, (929), 575 states have internal predecessors, (929), 101 states have call successors, (101), 29 states have call predecessors, (101), 29 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2025-03-03 14:11:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1130 transitions. [2025-03-03 14:11:43,615 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1130 transitions. Word has length 127 [2025-03-03 14:11:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:43,615 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1130 transitions. [2025-03-03 14:11:43,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:11:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1130 transitions. [2025-03-03 14:11:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:11:43,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:43,618 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:43,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:43,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 14:11:43,818 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:43,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:43,819 INFO L85 PathProgramCache]: Analyzing trace with hash 172742244, now seen corresponding path program 1 times [2025-03-03 14:11:43,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:43,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619455913] [2025-03-03 14:11:43,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:43,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:43,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:11:43,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:11:43,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:43,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:11:43,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619455913] [2025-03-03 14:11:43,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619455913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008231641] [2025-03-03 14:11:43,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:43,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:43,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:43,917 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:43,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 14:11:44,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:11:44,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:11:44,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:44,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:44,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:11:44,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:11:44,200 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:44,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008231641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:44,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:44,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-03-03 14:11:44,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059794040] [2025-03-03 14:11:44,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:44,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:11:44,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:44,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:11:44,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:11:44,203 INFO L87 Difference]: Start difference. First operand 688 states and 1130 transitions. Second operand has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:44,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:44,310 INFO L93 Difference]: Finished difference Result 1366 states and 2245 transitions. [2025-03-03 14:11:44,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:11:44,310 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 127 [2025-03-03 14:11:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:44,313 INFO L225 Difference]: With dead ends: 1366 [2025-03-03 14:11:44,314 INFO L226 Difference]: Without dead ends: 708 [2025-03-03 14:11:44,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:11:44,316 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 111 mSDsluCounter, 5593 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 6545 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:44,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 6545 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:44,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2025-03-03 14:11:44,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 688. [2025-03-03 14:11:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 557 states have (on average 1.666068222621185) internal successors, (928), 575 states have internal predecessors, (928), 101 states have call successors, (101), 29 states have call predecessors, (101), 29 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2025-03-03 14:11:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1129 transitions. [2025-03-03 14:11:44,333 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1129 transitions. Word has length 127 [2025-03-03 14:11:44,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:44,334 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1129 transitions. [2025-03-03 14:11:44,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1129 transitions. [2025-03-03 14:11:44,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:11:44,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:44,337 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:44,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:44,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 14:11:44,537 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:44,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:44,538 INFO L85 PathProgramCache]: Analyzing trace with hash -558923719, now seen corresponding path program 1 times [2025-03-03 14:11:44,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:44,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858300921] [2025-03-03 14:11:44,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:44,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:44,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:11:44,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:11:44,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:44,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:11:44,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:44,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858300921] [2025-03-03 14:11:44,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858300921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:44,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154528781] [2025-03-03 14:11:44,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:44,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:44,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:44,671 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:44,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 14:11:44,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:11:44,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:11:44,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:44,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:44,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 1386 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 14:11:44,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:11:44,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:44,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154528781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:44,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:44,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 7 [2025-03-03 14:11:44,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127448567] [2025-03-03 14:11:44,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:44,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:11:44,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:44,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:11:44,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:11:44,916 INFO L87 Difference]: Start difference. First operand 688 states and 1129 transitions. Second operand has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:44,996 INFO L93 Difference]: Finished difference Result 1373 states and 2252 transitions. [2025-03-03 14:11:44,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:11:44,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 128 [2025-03-03 14:11:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:45,001 INFO L225 Difference]: With dead ends: 1373 [2025-03-03 14:11:45,001 INFO L226 Difference]: Without dead ends: 702 [2025-03-03 14:11:45,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:11:45,004 INFO L435 NwaCegarLoop]: 974 mSDtfsCounter, 122 mSDsluCounter, 4731 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 5705 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:45,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 5705 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-03 14:11:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 681. [2025-03-03 14:11:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 550 states have (on average 1.6581818181818182) internal successors, (912), 568 states have internal predecessors, (912), 101 states have call successors, (101), 29 states have call predecessors, (101), 29 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2025-03-03 14:11:45,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1113 transitions. [2025-03-03 14:11:45,020 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1113 transitions. Word has length 128 [2025-03-03 14:11:45,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:45,020 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1113 transitions. [2025-03-03 14:11:45,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:45,021 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1113 transitions. [2025-03-03 14:11:45,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:11:45,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:45,023 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:45,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:45,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 14:11:45,224 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:45,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash -725849485, now seen corresponding path program 1 times [2025-03-03 14:11:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:45,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308799944] [2025-03-03 14:11:45,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:45,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:11:45,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:11:45,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:45,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 14:11:45,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:45,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308799944] [2025-03-03 14:11:45,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308799944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:45,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:45,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:11:45,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647918944] [2025-03-03 14:11:45,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:45,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:45,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:45,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:45,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:45,282 INFO L87 Difference]: Start difference. First operand 681 states and 1113 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:11:45,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:45,316 INFO L93 Difference]: Finished difference Result 1317 states and 2169 transitions. [2025-03-03 14:11:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:11:45,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-03-03 14:11:45,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:45,320 INFO L225 Difference]: With dead ends: 1317 [2025-03-03 14:11:45,320 INFO L226 Difference]: Without dead ends: 653 [2025-03-03 14:11:45,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:11:45,322 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 8 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2883 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:45,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2883 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:45,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-03-03 14:11:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2025-03-03 14:11:45,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 525 states have (on average 1.6514285714285715) internal successors, (867), 541 states have internal predecessors, (867), 100 states have call successors, (100), 29 states have call predecessors, (100), 27 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:11:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1064 transitions. [2025-03-03 14:11:45,336 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1064 transitions. Word has length 129 [2025-03-03 14:11:45,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:45,336 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 1064 transitions. [2025-03-03 14:11:45,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:11:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1064 transitions. [2025-03-03 14:11:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:11:45,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:45,339 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:45,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:11:45,339 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:45,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1204171008, now seen corresponding path program 1 times [2025-03-03 14:11:45,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:45,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890023467] [2025-03-03 14:11:45,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:45,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:45,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:11:45,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:11:45,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:45,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:11:45,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:45,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890023467] [2025-03-03 14:11:45,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890023467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:45,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:45,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:11:45,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738725965] [2025-03-03 14:11:45,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:45,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:11:45,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:45,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:11:45,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:11:45,436 INFO L87 Difference]: Start difference. First operand 653 states and 1064 transitions. Second operand has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:45,500 INFO L93 Difference]: Finished difference Result 1244 states and 2043 transitions. [2025-03-03 14:11:45,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:11:45,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 129 [2025-03-03 14:11:45,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:45,521 INFO L225 Difference]: With dead ends: 1244 [2025-03-03 14:11:45,521 INFO L226 Difference]: Without dead ends: 648 [2025-03-03 14:11:45,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:11:45,525 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 126 mSDsluCounter, 4685 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 5647 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:45,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 5647 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-03-03 14:11:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 639. [2025-03-03 14:11:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 511 states have (on average 1.6418786692759295) internal successors, (839), 527 states have internal predecessors, (839), 100 states have call successors, (100), 29 states have call predecessors, (100), 27 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 14:11:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1036 transitions. [2025-03-03 14:11:45,543 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1036 transitions. Word has length 129 [2025-03-03 14:11:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:45,543 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 1036 transitions. [2025-03-03 14:11:45,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:11:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1036 transitions. [2025-03-03 14:11:45,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:11:45,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:45,545 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:45,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:11:45,545 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:45,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:45,546 INFO L85 PathProgramCache]: Analyzing trace with hash 393631950, now seen corresponding path program 1 times [2025-03-03 14:11:45,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:45,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37708044] [2025-03-03 14:11:45,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:45,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:45,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:11:45,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:11:45,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:45,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:11:45,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:45,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37708044] [2025-03-03 14:11:45,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37708044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:45,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:45,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:11:45,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094728678] [2025-03-03 14:11:45,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:45,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:45,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:45,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:45,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:45,616 INFO L87 Difference]: Start difference. First operand 639 states and 1036 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:11:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:46,133 INFO L93 Difference]: Finished difference Result 1757 states and 2944 transitions. [2025-03-03 14:11:46,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:11:46,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 130 [2025-03-03 14:11:46,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:46,139 INFO L225 Difference]: With dead ends: 1757 [2025-03-03 14:11:46,139 INFO L226 Difference]: Without dead ends: 1188 [2025-03-03 14:11:46,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:46,142 INFO L435 NwaCegarLoop]: 1882 mSDtfsCounter, 1859 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1859 SdHoareTripleChecker+Valid, 3362 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:46,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1859 Valid, 3362 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:11:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2025-03-03 14:11:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1184. [2025-03-03 14:11:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 946 states have (on average 1.650105708245243) internal successors, (1561), 976 states have internal predecessors, (1561), 188 states have call successors, (188), 52 states have call predecessors, (188), 49 states have return successors, (205), 181 states have call predecessors, (205), 184 states have call successors, (205) [2025-03-03 14:11:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1954 transitions. [2025-03-03 14:11:46,169 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1954 transitions. Word has length 130 [2025-03-03 14:11:46,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:46,170 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1954 transitions. [2025-03-03 14:11:46,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:11:46,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1954 transitions. [2025-03-03 14:11:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:11:46,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:46,172 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:46,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:11:46,172 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:46,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:46,172 INFO L85 PathProgramCache]: Analyzing trace with hash -5339403, now seen corresponding path program 1 times [2025-03-03 14:11:46,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:46,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836208264] [2025-03-03 14:11:46,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:46,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:46,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:11:46,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:11:46,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:46,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:11:46,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:46,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836208264] [2025-03-03 14:11:46,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836208264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:46,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:46,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:11:46,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346890341] [2025-03-03 14:11:46,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:46,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:46,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:46,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:46,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:46,248 INFO L87 Difference]: Start difference. First operand 1184 states and 1954 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:11:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:46,828 INFO L93 Difference]: Finished difference Result 3397 states and 5779 transitions. [2025-03-03 14:11:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:11:46,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 131 [2025-03-03 14:11:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:46,839 INFO L225 Difference]: With dead ends: 3397 [2025-03-03 14:11:46,839 INFO L226 Difference]: Without dead ends: 2283 [2025-03-03 14:11:46,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:46,848 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 1868 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 3378 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:46,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1868 Valid, 3378 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:11:46,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2025-03-03 14:11:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2279. [2025-03-03 14:11:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 1820 states have (on average 1.6505494505494505) internal successors, (3004), 1878 states have internal predecessors, (3004), 365 states have call successors, (365), 98 states have call predecessors, (365), 93 states have return successors, (452), 354 states have call predecessors, (452), 359 states have call successors, (452) [2025-03-03 14:11:46,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3821 transitions. [2025-03-03 14:11:46,912 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3821 transitions. Word has length 131 [2025-03-03 14:11:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:46,913 INFO L471 AbstractCegarLoop]: Abstraction has 2279 states and 3821 transitions. [2025-03-03 14:11:46,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:11:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3821 transitions. [2025-03-03 14:11:46,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:11:46,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:46,915 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:46,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:11:46,915 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:46,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:46,915 INFO L85 PathProgramCache]: Analyzing trace with hash 925765801, now seen corresponding path program 1 times [2025-03-03 14:11:46,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:46,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157583330] [2025-03-03 14:11:46,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:46,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:46,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:11:46,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:11:46,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:46,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:11:46,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:46,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157583330] [2025-03-03 14:11:46,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157583330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:46,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:46,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:11:46,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738662864] [2025-03-03 14:11:46,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:46,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:46,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:46,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:46,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:46,986 INFO L87 Difference]: Start difference. First operand 2279 states and 3821 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:11:47,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:47,594 INFO L93 Difference]: Finished difference Result 6687 states and 11629 transitions. [2025-03-03 14:11:47,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:11:47,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 132 [2025-03-03 14:11:47,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:47,615 INFO L225 Difference]: With dead ends: 6687 [2025-03-03 14:11:47,615 INFO L226 Difference]: Without dead ends: 4478 [2025-03-03 14:11:47,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:47,625 INFO L435 NwaCegarLoop]: 1900 mSDtfsCounter, 1877 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1877 SdHoareTripleChecker+Valid, 3394 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:47,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1877 Valid, 3394 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:11:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2025-03-03 14:11:47,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 4474. [2025-03-03 14:11:47,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4474 states, 3572 states have (on average 1.6464165733482643) internal successors, (5881), 3686 states have internal predecessors, (5881), 720 states have call successors, (720), 190 states have call predecessors, (720), 181 states have return successors, (1055), 701 states have call predecessors, (1055), 710 states have call successors, (1055) [2025-03-03 14:11:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 7656 transitions. [2025-03-03 14:11:47,749 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 7656 transitions. Word has length 132 [2025-03-03 14:11:47,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:47,749 INFO L471 AbstractCegarLoop]: Abstraction has 4474 states and 7656 transitions. [2025-03-03 14:11:47,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:11:47,750 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 7656 transitions. [2025-03-03 14:11:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:11:47,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:47,752 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:47,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:11:47,752 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:47,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:47,753 INFO L85 PathProgramCache]: Analyzing trace with hash 139571312, now seen corresponding path program 1 times [2025-03-03 14:11:47,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:47,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102491791] [2025-03-03 14:11:47,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:47,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:47,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:11:47,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:11:47,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:47,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:11:47,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:47,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102491791] [2025-03-03 14:11:47,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102491791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:47,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:47,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:11:47,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551858845] [2025-03-03 14:11:47,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:47,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:47,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:47,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:47,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:47,820 INFO L87 Difference]: Start difference. First operand 4474 states and 7656 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:11:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:48,581 INFO L93 Difference]: Finished difference Result 13277 states and 24007 transitions. [2025-03-03 14:11:48,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:11:48,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 133 [2025-03-03 14:11:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:48,635 INFO L225 Difference]: With dead ends: 13277 [2025-03-03 14:11:48,635 INFO L226 Difference]: Without dead ends: 8873 [2025-03-03 14:11:48,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:48,666 INFO L435 NwaCegarLoop]: 1909 mSDtfsCounter, 1886 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1886 SdHoareTripleChecker+Valid, 3410 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:48,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1886 Valid, 3410 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:11:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8873 states. [2025-03-03 14:11:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8873 to 8869. [2025-03-03 14:11:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8869 states, 7080 states have (on average 1.6398305084745763) internal successors, (11610), 7306 states have internal predecessors, (11610), 1431 states have call successors, (1431), 374 states have call predecessors, (1431), 357 states have return successors, (2670), 1396 states have call predecessors, (2670), 1413 states have call successors, (2670) [2025-03-03 14:11:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8869 states to 8869 states and 15711 transitions. [2025-03-03 14:11:49,026 INFO L78 Accepts]: Start accepts. Automaton has 8869 states and 15711 transitions. Word has length 133 [2025-03-03 14:11:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:49,026 INFO L471 AbstractCegarLoop]: Abstraction has 8869 states and 15711 transitions. [2025-03-03 14:11:49,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:11:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 8869 states and 15711 transitions. [2025-03-03 14:11:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 14:11:49,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:49,029 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:49,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:11:49,029 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:49,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:49,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1470580930, now seen corresponding path program 1 times [2025-03-03 14:11:49,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:49,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974775075] [2025-03-03 14:11:49,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:49,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:49,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 14:11:49,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 14:11:49,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:49,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:11:49,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:49,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974775075] [2025-03-03 14:11:49,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974775075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:49,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:49,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:11:49,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840301622] [2025-03-03 14:11:49,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:49,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:11:49,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:49,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:11:49,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:11:49,156 INFO L87 Difference]: Start difference. First operand 8869 states and 15711 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:11:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:49,807 INFO L93 Difference]: Finished difference Result 26581 states and 47013 transitions. [2025-03-03 14:11:49,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:11:49,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 134 [2025-03-03 14:11:49,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:49,880 INFO L225 Difference]: With dead ends: 26581 [2025-03-03 14:11:49,880 INFO L226 Difference]: Without dead ends: 17797 [2025-03-03 14:11:49,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:11:49,998 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 1109 mSDsluCounter, 4807 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 5806 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:49,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 5806 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:50,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17797 states. [2025-03-03 14:11:50,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17797 to 17601. [2025-03-03 14:11:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17601 states, 14084 states have (on average 1.6375319511502413) internal successors, (23063), 14502 states have internal predecessors, (23063), 2775 states have call successors, (2775), 726 states have call predecessors, (2775), 741 states have return successors, (5241), 2788 states have call predecessors, (5241), 2741 states have call successors, (5241) [2025-03-03 14:11:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17601 states to 17601 states and 31079 transitions. [2025-03-03 14:11:50,964 INFO L78 Accepts]: Start accepts. Automaton has 17601 states and 31079 transitions. Word has length 134 [2025-03-03 14:11:50,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:50,965 INFO L471 AbstractCegarLoop]: Abstraction has 17601 states and 31079 transitions. [2025-03-03 14:11:50,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:11:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 17601 states and 31079 transitions. [2025-03-03 14:11:50,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:11:50,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:50,968 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:50,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 14:11:50,968 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:50,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:50,969 INFO L85 PathProgramCache]: Analyzing trace with hash 419478743, now seen corresponding path program 1 times [2025-03-03 14:11:50,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:50,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377945030] [2025-03-03 14:11:50,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:50,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:50,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:11:50,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:11:50,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:50,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:11:51,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:51,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377945030] [2025-03-03 14:11:51,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377945030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:51,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:51,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:11:51,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204707907] [2025-03-03 14:11:51,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:51,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:11:51,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:51,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:11:51,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:11:51,071 INFO L87 Difference]: Start difference. First operand 17601 states and 31079 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:11:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:51,831 INFO L93 Difference]: Finished difference Result 35421 states and 62476 transitions. [2025-03-03 14:11:51,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:11:51,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) Word has length 140 [2025-03-03 14:11:51,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:51,896 INFO L225 Difference]: With dead ends: 35421 [2025-03-03 14:11:51,896 INFO L226 Difference]: Without dead ends: 17905 [2025-03-03 14:11:51,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:11:51,996 INFO L435 NwaCegarLoop]: 977 mSDtfsCounter, 0 mSDsluCounter, 4848 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5825 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:51,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5825 Invalid, 51 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:52,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17905 states. [2025-03-03 14:11:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17905 to 17825. [2025-03-03 14:11:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17825 states, 14244 states have (on average 1.6303706823925863) internal successors, (23223), 14662 states have internal predecessors, (23223), 2775 states have call successors, (2775), 726 states have call predecessors, (2775), 805 states have return successors, (5401), 2852 states have call predecessors, (5401), 2741 states have call successors, (5401) [2025-03-03 14:11:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17825 states to 17825 states and 31399 transitions. [2025-03-03 14:11:52,671 INFO L78 Accepts]: Start accepts. Automaton has 17825 states and 31399 transitions. Word has length 140 [2025-03-03 14:11:52,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:52,671 INFO L471 AbstractCegarLoop]: Abstraction has 17825 states and 31399 transitions. [2025-03-03 14:11:52,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:11:52,671 INFO L276 IsEmpty]: Start isEmpty. Operand 17825 states and 31399 transitions. [2025-03-03 14:11:52,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:11:52,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:52,675 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:52,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 14:11:52,676 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:52,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:52,676 INFO L85 PathProgramCache]: Analyzing trace with hash 122191920, now seen corresponding path program 1 times [2025-03-03 14:11:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:52,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307296218] [2025-03-03 14:11:52,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:52,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:11:52,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:11:52,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:52,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:11:52,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:52,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307296218] [2025-03-03 14:11:52,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307296218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:52,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:52,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:11:52,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625206952] [2025-03-03 14:11:52,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:52,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:11:52,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:52,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:11:52,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:11:52,790 INFO L87 Difference]: Start difference. First operand 17825 states and 31399 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:11:53,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:53,840 INFO L93 Difference]: Finished difference Result 35805 states and 62988 transitions. [2025-03-03 14:11:53,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:11:53,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) Word has length 139 [2025-03-03 14:11:53,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:53,941 INFO L225 Difference]: With dead ends: 35805 [2025-03-03 14:11:53,941 INFO L226 Difference]: Without dead ends: 18065 [2025-03-03 14:11:54,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:11:54,106 INFO L435 NwaCegarLoop]: 977 mSDtfsCounter, 0 mSDsluCounter, 4848 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5825 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:54,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5825 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:54,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18065 states. [2025-03-03 14:11:54,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18065 to 17857. [2025-03-03 14:11:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17857 states, 14276 states have (on average 1.6289576912300365) internal successors, (23255), 14662 states have internal predecessors, (23255), 2775 states have call successors, (2775), 726 states have call predecessors, (2775), 805 states have return successors, (5401), 2884 states have call predecessors, (5401), 2741 states have call successors, (5401) [2025-03-03 14:11:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17857 states to 17857 states and 31431 transitions. [2025-03-03 14:11:55,073 INFO L78 Accepts]: Start accepts. Automaton has 17857 states and 31431 transitions. Word has length 139 [2025-03-03 14:11:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:55,074 INFO L471 AbstractCegarLoop]: Abstraction has 17857 states and 31431 transitions. [2025-03-03 14:11:55,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:11:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 17857 states and 31431 transitions. [2025-03-03 14:11:55,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:11:55,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:55,077 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:55,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 14:11:55,077 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:55,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:55,078 INFO L85 PathProgramCache]: Analyzing trace with hash 134878808, now seen corresponding path program 1 times [2025-03-03 14:11:55,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:55,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468679935] [2025-03-03 14:11:55,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:55,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:55,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:11:55,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:11:55,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:55,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:11:55,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:55,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468679935] [2025-03-03 14:11:55,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468679935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:55,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:55,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:11:55,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130349900] [2025-03-03 14:11:55,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:55,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:55,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:55,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:55,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:55,148 INFO L87 Difference]: Start difference. First operand 17857 states and 31431 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:11:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:55,882 INFO L93 Difference]: Finished difference Result 35652 states and 62547 transitions. [2025-03-03 14:11:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:11:55,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 140 [2025-03-03 14:11:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:55,952 INFO L225 Difference]: With dead ends: 35652 [2025-03-03 14:11:55,952 INFO L226 Difference]: Without dead ends: 17880 [2025-03-03 14:11:56,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:56,070 INFO L435 NwaCegarLoop]: 977 mSDtfsCounter, 3 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2919 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:56,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2919 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17880 states. [2025-03-03 14:11:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17880 to 17863. [2025-03-03 14:11:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17863 states, 14282 states have (on average 1.6288334967091445) internal successors, (23263), 14668 states have internal predecessors, (23263), 2775 states have call successors, (2775), 726 states have call predecessors, (2775), 805 states have return successors, (5401), 2884 states have call predecessors, (5401), 2741 states have call successors, (5401) [2025-03-03 14:11:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17863 states to 17863 states and 31439 transitions. [2025-03-03 14:11:56,748 INFO L78 Accepts]: Start accepts. Automaton has 17863 states and 31439 transitions. Word has length 140 [2025-03-03 14:11:56,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:56,749 INFO L471 AbstractCegarLoop]: Abstraction has 17863 states and 31439 transitions. [2025-03-03 14:11:56,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:11:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 17863 states and 31439 transitions. [2025-03-03 14:11:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:11:56,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:56,752 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:11:56,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 14:11:56,752 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:56,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:56,752 INFO L85 PathProgramCache]: Analyzing trace with hash 94204058, now seen corresponding path program 1 times [2025-03-03 14:11:56,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:56,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982007933] [2025-03-03 14:11:56,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:56,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:56,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:11:56,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:11:56,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:56,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:11:56,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:56,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982007933] [2025-03-03 14:11:56,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982007933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:56,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:56,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:11:56,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039563750] [2025-03-03 14:11:56,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:56,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:56,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:56,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:56,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:56,817 INFO L87 Difference]: Start difference. First operand 17863 states and 31439 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-03 14:11:59,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:59,090 INFO L93 Difference]: Finished difference Result 53431 states and 102494 transitions. [2025-03-03 14:11:59,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:11:59,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 140 [2025-03-03 14:11:59,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:59,275 INFO L225 Difference]: With dead ends: 53431 [2025-03-03 14:11:59,276 INFO L226 Difference]: Without dead ends: 35638 [2025-03-03 14:11:59,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:59,525 INFO L435 NwaCegarLoop]: 1918 mSDtfsCounter, 1894 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1894 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:59,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1894 Valid, 3426 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:11:59,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35638 states. [2025-03-03 14:12:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35638 to 35634. [2025-03-03 14:12:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35634 states, 28489 states have (on average 1.620414896977781) internal successors, (46164), 29260 states have internal predecessors, (46164), 5539 states have call successors, (5539), 1446 states have call predecessors, (5539), 1605 states have return successors, (14578), 5759 states have call predecessors, (14578), 5473 states have call successors, (14578) [2025-03-03 14:12:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35634 states to 35634 states and 66281 transitions. [2025-03-03 14:12:01,540 INFO L78 Accepts]: Start accepts. Automaton has 35634 states and 66281 transitions. Word has length 140 [2025-03-03 14:12:01,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:12:01,540 INFO L471 AbstractCegarLoop]: Abstraction has 35634 states and 66281 transitions. [2025-03-03 14:12:01,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-03 14:12:01,541 INFO L276 IsEmpty]: Start isEmpty. Operand 35634 states and 66281 transitions. [2025-03-03 14:12:01,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:12:01,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:12:01,544 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:12:01,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 14:12:01,545 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:12:01,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:12:01,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1042624861, now seen corresponding path program 1 times [2025-03-03 14:12:01,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:12:01,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458559269] [2025-03-03 14:12:01,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:12:01,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:12:01,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:12:01,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:12:01,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:12:01,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:12:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:12:01,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:12:01,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458559269] [2025-03-03 14:12:01,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458559269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:12:01,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:12:01,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:12:01,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175276899] [2025-03-03 14:12:01,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:12:01,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:12:01,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:12:01,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:12:01,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:12:01,657 INFO L87 Difference]: Start difference. First operand 35634 states and 66281 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:12:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:12:06,991 INFO L93 Difference]: Finished difference Result 122783 states and 227568 transitions. [2025-03-03 14:12:06,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:12:06,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 149 [2025-03-03 14:12:06,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:12:07,360 INFO L225 Difference]: With dead ends: 122783 [2025-03-03 14:12:07,360 INFO L226 Difference]: Without dead ends: 87250 [2025-03-03 14:12:07,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:12:07,736 INFO L435 NwaCegarLoop]: 1792 mSDtfsCounter, 1795 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1795 SdHoareTripleChecker+Valid, 3383 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:12:07,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1795 Valid, 3383 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:12:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87250 states. [2025-03-03 14:12:11,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87250 to 87114. [2025-03-03 14:12:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87114 states, 69384 states have (on average 1.601867865790384) internal successors, (111144), 71309 states have internal predecessors, (111144), 13564 states have call successors, (13564), 3782 states have call predecessors, (13564), 4165 states have return successors, (34482), 14070 states have call predecessors, (34482), 13402 states have call successors, (34482) [2025-03-03 14:12:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87114 states to 87114 states and 159190 transitions. [2025-03-03 14:12:12,806 INFO L78 Accepts]: Start accepts. Automaton has 87114 states and 159190 transitions. Word has length 149 [2025-03-03 14:12:12,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:12:12,806 INFO L471 AbstractCegarLoop]: Abstraction has 87114 states and 159190 transitions. [2025-03-03 14:12:12,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:12:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 87114 states and 159190 transitions. [2025-03-03 14:12:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 14:12:12,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:12:12,811 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:12:12,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 14:12:12,811 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:12:12,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:12:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2072764998, now seen corresponding path program 1 times [2025-03-03 14:12:12,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:12:12,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825302709] [2025-03-03 14:12:12,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:12:12,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:12:12,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:12:12,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:12:12,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:12:12,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:12:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:12:12,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:12:12,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825302709] [2025-03-03 14:12:12,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825302709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:12:12,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221348323] [2025-03-03 14:12:12,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:12:12,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:12:12,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:12:12,913 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:12:12,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 14:12:13,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:12:13,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:12:13,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:12:13,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:12:13,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:12:13,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:12:13,188 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:12:13,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:12:13,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221348323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:12:13,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:12:13,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-03 14:12:13,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145549992] [2025-03-03 14:12:13,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:12:13,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:12:13,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:12:13,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:12:13,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:12:13,191 INFO L87 Difference]: Start difference. First operand 87114 states and 159190 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)