./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f20249a191004f50add5285446ee5ffba043f1ff9b40e0e115c641082e595e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:48:25,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:48:25,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:48:25,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:48:25,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:48:25,693 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:48:25,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:48:25,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:48:25,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:48:25,695 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:48:25,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:48:25,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:48:25,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:48:25,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:48:25,696 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:48:25,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:48:25,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:48:25,696 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:48:25,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:48:25,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:48:25,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:48:25,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:48:25,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:48:25,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:48:25,697 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:48:25,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:48:25,697 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:48:25,697 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:48:25,697 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:48:25,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:48:25,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:48:25,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:48:25,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:25,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:48:25,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:48:25,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:48:25,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:48:25,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:25,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:48:25,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:48:25,699 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:48:25,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:48:25,699 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:48:25,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:48:25,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:48:25,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:48:25,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:48:25,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:48:25,699 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f20249a191004f50add5285446ee5ffba043f1ff9b40e0e115c641082e595e2 [2025-01-09 03:48:25,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:48:25,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:48:25,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:48:25,941 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:48:25,941 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:48:25,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c [2025-01-09 03:48:27,176 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67286bd20/50be397653fe4ae2adf11d1dc1b25d89/FLAGfa88ae079 [2025-01-09 03:48:27,542 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:48:27,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c [2025-01-09 03:48:27,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67286bd20/50be397653fe4ae2adf11d1dc1b25d89/FLAGfa88ae079 [2025-01-09 03:48:27,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67286bd20/50be397653fe4ae2adf11d1dc1b25d89 [2025-01-09 03:48:27,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:48:27,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:48:27,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:48:27,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:48:27,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:48:27,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:27" (1/1) ... [2025-01-09 03:48:27,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e35fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:27, skipping insertion in model container [2025-01-09 03:48:27,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:27" (1/1) ... [2025-01-09 03:48:27,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:48:28,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c[17414,17427] [2025-01-09 03:48:28,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:48:28,244 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:48:28,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2025-01-09 03:48:28,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [716] [2025-01-09 03:48:28,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [725] [2025-01-09 03:48:28,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [739] [2025-01-09 03:48:28,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [905] [2025-01-09 03:48:28,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2574] [2025-01-09 03:48:28,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2940] [2025-01-09 03:48:28,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2978] [2025-01-09 03:48:28,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3330] [2025-01-09 03:48:28,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3448] [2025-01-09 03:48:28,274 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c[17414,17427] [2025-01-09 03:48:28,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:48:28,374 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:48:28,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28 WrapperNode [2025-01-09 03:48:28,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:48:28,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:48:28,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:48:28,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:48:28,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 03:48:28,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 03:48:28,440 INFO L138 Inliner]: procedures = 99, calls = 352, calls flagged for inlining = 28, calls inlined = 24, statements flattened = 930 [2025-01-09 03:48:28,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:48:28,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:48:28,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:48:28,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:48:28,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 03:48:28,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 03:48:28,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 03:48:28,475 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-01-09 03:48:28,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 03:48:28,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 03:48:28,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 03:48:28,490 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 03:48:28,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 03:48:28,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 03:48:28,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 03:48:28,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:48:28,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:48:28,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:48:28,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:48:28,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 03:48:28,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:28,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:28,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:48:28,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:48:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-01-09 03:48:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-01-09 03:48:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:48:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:48:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:48:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:48:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-01-09 03:48:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-01-09 03:48:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:48:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:48:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:48:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:48:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:48:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:48:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-01-09 03:48:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-01-09 03:48:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-01-09 03:48:28,571 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-01-09 03:48:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:48:28,571 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:48:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:48:28,571 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:48:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:48:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-01-09 03:48:28,571 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-01-09 03:48:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:48:28,571 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:48:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-01-09 03:48:28,571 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-01-09 03:48:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:48:28,571 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:48:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:48:28,571 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:48:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-01-09 03:48:28,571 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-01-09 03:48:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:48:28,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:48:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:48:28,571 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:48:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:48:28,572 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:48:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:48:28,572 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:48:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:48:28,572 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:48:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:48:28,572 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:48:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:48:28,572 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:48:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-01-09 03:48:28,572 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-01-09 03:48:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:48:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:48:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:48:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:48:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:48:28,573 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:48:28,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:48:28,573 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:48:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2025-01-09 03:48:28,573 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2025-01-09 03:48:28,743 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:48:28,745 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:48:29,689 INFO L? ?]: Removed 478 outVars from TransFormulas that were not future-live. [2025-01-09 03:48:29,689 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:48:29,745 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:48:29,749 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:48:29,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:29 BoogieIcfgContainer [2025-01-09 03:48:29,750 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:48:29,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:48:29,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:48:29,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:48:29,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:48:27" (1/3) ... [2025-01-09 03:48:29,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d0ce41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:29, skipping insertion in model container [2025-01-09 03:48:29,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (2/3) ... [2025-01-09 03:48:29,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d0ce41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:29, skipping insertion in model container [2025-01-09 03:48:29,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:29" (3/3) ... [2025-01-09 03:48:29,763 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product32.cil.c [2025-01-09 03:48:29,782 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:48:29,788 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product32.cil.c that has 29 procedures, 599 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:48:29,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:48:29,898 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;@a4c2093, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:48:29,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:48:29,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 599 states, 466 states have (on average 1.6759656652360515) internal successors, (781), 489 states have internal predecessors, (781), 103 states have call successors, (103), 28 states have call predecessors, (103), 28 states have return successors, (103), 96 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 03:48:29,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 03:48:29,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:29,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:29,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:29,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:29,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1914479802, now seen corresponding path program 1 times [2025-01-09 03:48:29,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:29,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035330445] [2025-01-09 03:48:29,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:29,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:29,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 03:48:30,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 03:48:30,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:30,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:30,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:30,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035330445] [2025-01-09 03:48:30,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035330445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:30,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:30,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:30,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344380734] [2025-01-09 03:48:30,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:30,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:30,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:30,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:30,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:30,343 INFO L87 Difference]: Start difference. First operand has 599 states, 466 states have (on average 1.6759656652360515) internal successors, (781), 489 states have internal predecessors, (781), 103 states have call successors, (103), 28 states have call predecessors, (103), 28 states have return successors, (103), 96 states have call predecessors, (103), 103 states have call successors, (103) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:30,495 INFO L93 Difference]: Finished difference Result 1178 states and 1949 transitions. [2025-01-09 03:48:30,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:30,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2025-01-09 03:48:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:30,516 INFO L225 Difference]: With dead ends: 1178 [2025-01-09 03:48:30,517 INFO L226 Difference]: Without dead ends: 591 [2025-01-09 03:48:30,528 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-01-09 03:48:30,531 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 5 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2897 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:30,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2897 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-01-09 03:48:30,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-01-09 03:48:30,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 460 states have (on average 1.673913043478261) internal successors, (770), 481 states have internal predecessors, (770), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 03:48:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 971 transitions. [2025-01-09 03:48:30,628 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 971 transitions. Word has length 62 [2025-01-09 03:48:30,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:30,629 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 971 transitions. [2025-01-09 03:48:30,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 971 transitions. [2025-01-09 03:48:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 03:48:30,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:30,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:30,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:48:30,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:30,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:30,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1064227249, now seen corresponding path program 1 times [2025-01-09 03:48:30,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:30,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171865262] [2025-01-09 03:48:30,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:30,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:30,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 03:48:30,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 03:48:30,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:30,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:30,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:30,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171865262] [2025-01-09 03:48:30,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171865262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:30,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:30,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:30,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671385717] [2025-01-09 03:48:30,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:30,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:30,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:30,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:30,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:30,807 INFO L87 Difference]: Start difference. First operand 591 states and 971 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:30,867 INFO L93 Difference]: Finished difference Result 1164 states and 1919 transitions. [2025-01-09 03:48:30,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:30,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 64 [2025-01-09 03:48:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:30,871 INFO L225 Difference]: With dead ends: 1164 [2025-01-09 03:48:30,872 INFO L226 Difference]: Without dead ends: 591 [2025-01-09 03:48:30,874 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-01-09 03:48:30,874 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 4 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:30,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2876 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:30,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-01-09 03:48:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-01-09 03:48:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 460 states have (on average 1.6717391304347826) internal successors, (769), 481 states have internal predecessors, (769), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 03:48:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 970 transitions. [2025-01-09 03:48:30,896 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 970 transitions. Word has length 64 [2025-01-09 03:48:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:30,897 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 970 transitions. [2025-01-09 03:48:30,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 970 transitions. [2025-01-09 03:48:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 03:48:30,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:30,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:30,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:48:30,899 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:30,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:30,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1220040150, now seen corresponding path program 1 times [2025-01-09 03:48:30,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:30,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849577598] [2025-01-09 03:48:30,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:30,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:30,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 03:48:30,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 03:48:30,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:30,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:31,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:31,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849577598] [2025-01-09 03:48:31,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849577598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:31,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:31,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:31,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066438629] [2025-01-09 03:48:31,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:31,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:31,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:31,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:31,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:31,084 INFO L87 Difference]: Start difference. First operand 591 states and 970 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:31,145 INFO L93 Difference]: Finished difference Result 1164 states and 1918 transitions. [2025-01-09 03:48:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:31,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2025-01-09 03:48:31,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:31,153 INFO L225 Difference]: With dead ends: 1164 [2025-01-09 03:48:31,153 INFO L226 Difference]: Without dead ends: 591 [2025-01-09 03:48:31,155 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-01-09 03:48:31,156 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 3 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:31,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2876 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-01-09 03:48:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-01-09 03:48:31,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 460 states have (on average 1.6695652173913043) internal successors, (768), 481 states have internal predecessors, (768), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 03:48:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 969 transitions. [2025-01-09 03:48:31,191 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 969 transitions. Word has length 65 [2025-01-09 03:48:31,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:31,191 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 969 transitions. [2025-01-09 03:48:31,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:31,192 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 969 transitions. [2025-01-09 03:48:31,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 03:48:31,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:31,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:31,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:48:31,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:31,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:31,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1517477709, now seen corresponding path program 1 times [2025-01-09 03:48:31,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:31,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659253298] [2025-01-09 03:48:31,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:31,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:31,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 03:48:31,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 03:48:31,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:31,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:31,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:31,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659253298] [2025-01-09 03:48:31,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659253298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:31,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:31,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:31,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441062590] [2025-01-09 03:48:31,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:31,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:31,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:31,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:31,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:31,352 INFO L87 Difference]: Start difference. First operand 591 states and 969 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:31,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:31,402 INFO L93 Difference]: Finished difference Result 1164 states and 1917 transitions. [2025-01-09 03:48:31,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:31,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2025-01-09 03:48:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:31,408 INFO L225 Difference]: With dead ends: 1164 [2025-01-09 03:48:31,408 INFO L226 Difference]: Without dead ends: 591 [2025-01-09 03:48:31,411 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-01-09 03:48:31,413 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 2 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:31,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2876 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:31,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-01-09 03:48:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-01-09 03:48:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 460 states have (on average 1.6673913043478261) internal successors, (767), 481 states have internal predecessors, (767), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 03:48:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 968 transitions. [2025-01-09 03:48:31,442 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 968 transitions. Word has length 66 [2025-01-09 03:48:31,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:31,442 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 968 transitions. [2025-01-09 03:48:31,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:31,443 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 968 transitions. [2025-01-09 03:48:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 03:48:31,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:31,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:31,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:48:31,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:31,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:31,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1910312370, now seen corresponding path program 1 times [2025-01-09 03:48:31,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:31,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042961867] [2025-01-09 03:48:31,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:31,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 03:48:31,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 03:48:31,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:31,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:31,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:31,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042961867] [2025-01-09 03:48:31,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042961867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:31,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:31,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:31,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661013505] [2025-01-09 03:48:31,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:31,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:31,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:31,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:31,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:31,564 INFO L87 Difference]: Start difference. First operand 591 states and 968 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:31,605 INFO L93 Difference]: Finished difference Result 1164 states and 1916 transitions. [2025-01-09 03:48:31,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:31,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2025-01-09 03:48:31,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:31,610 INFO L225 Difference]: With dead ends: 1164 [2025-01-09 03:48:31,610 INFO L226 Difference]: Without dead ends: 591 [2025-01-09 03:48:31,613 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-01-09 03:48:31,614 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 1 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:31,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2876 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:31,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-01-09 03:48:31,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-01-09 03:48:31,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 460 states have (on average 1.6652173913043478) internal successors, (766), 481 states have internal predecessors, (766), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 03:48:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 967 transitions. [2025-01-09 03:48:31,643 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 967 transitions. Word has length 67 [2025-01-09 03:48:31,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:31,643 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 967 transitions. [2025-01-09 03:48:31,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:31,643 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 967 transitions. [2025-01-09 03:48:31,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:48:31,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:31,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:31,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:48:31,645 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:31,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:31,645 INFO L85 PathProgramCache]: Analyzing trace with hash -965489897, now seen corresponding path program 1 times [2025-01-09 03:48:31,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:31,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215918380] [2025-01-09 03:48:31,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:31,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:31,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:48:31,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:48:31,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:31,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:31,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:31,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215918380] [2025-01-09 03:48:31,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215918380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:31,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:31,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:48:31,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122534481] [2025-01-09 03:48:31,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:31,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:48:31,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:31,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:48:31,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:31,874 INFO L87 Difference]: Start difference. First operand 591 states and 967 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:31,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:31,996 INFO L93 Difference]: Finished difference Result 1130 states and 1848 transitions. [2025-01-09 03:48:31,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:48:31,998 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2025-01-09 03:48:31,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:32,002 INFO L225 Difference]: With dead ends: 1130 [2025-01-09 03:48:32,003 INFO L226 Difference]: Without dead ends: 606 [2025-01-09 03:48:32,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-01-09 03:48:32,005 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 91 mSDsluCounter, 6602 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7557 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:32,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7557 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-01-09 03:48:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 604. [2025-01-09 03:48:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 470 states have (on average 1.6617021276595745) internal successors, (781), 493 states have internal predecessors, (781), 104 states have call successors, (104), 28 states have call predecessors, (104), 29 states have return successors, (101), 96 states have call predecessors, (101), 99 states have call successors, (101) [2025-01-09 03:48:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 986 transitions. [2025-01-09 03:48:32,031 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 986 transitions. Word has length 68 [2025-01-09 03:48:32,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:32,031 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 986 transitions. [2025-01-09 03:48:32,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:32,031 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 986 transitions. [2025-01-09 03:48:32,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:48:32,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:32,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:32,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:48:32,035 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:32,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:32,036 INFO L85 PathProgramCache]: Analyzing trace with hash 167700696, now seen corresponding path program 1 times [2025-01-09 03:48:32,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:32,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262563747] [2025-01-09 03:48:32,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:32,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:32,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:48:32,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:48:32,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:32,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:32,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:32,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262563747] [2025-01-09 03:48:32,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262563747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:32,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:32,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:32,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199770771] [2025-01-09 03:48:32,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:32,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:32,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:32,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:32,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:32,113 INFO L87 Difference]: Start difference. First operand 604 states and 986 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:32,144 INFO L93 Difference]: Finished difference Result 1182 states and 1942 transitions. [2025-01-09 03:48:32,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:32,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2025-01-09 03:48:32,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:32,148 INFO L225 Difference]: With dead ends: 1182 [2025-01-09 03:48:32,148 INFO L226 Difference]: Without dead ends: 585 [2025-01-09 03:48:32,150 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-01-09 03:48:32,150 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 0 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:32,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2878 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:32,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-01-09 03:48:32,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2025-01-09 03:48:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 454 states have (on average 1.6563876651982379) internal successors, (752), 475 states have internal predecessors, (752), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 03:48:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 953 transitions. [2025-01-09 03:48:32,167 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 953 transitions. Word has length 68 [2025-01-09 03:48:32,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:32,167 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 953 transitions. [2025-01-09 03:48:32,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:32,167 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 953 transitions. [2025-01-09 03:48:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 03:48:32,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:32,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:32,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:48:32,168 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:32,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:32,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1966738782, now seen corresponding path program 1 times [2025-01-09 03:48:32,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:32,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221473304] [2025-01-09 03:48:32,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:32,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:32,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 03:48:32,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 03:48:32,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:32,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:32,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:32,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221473304] [2025-01-09 03:48:32,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221473304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:32,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:32,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:32,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570067989] [2025-01-09 03:48:32,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:32,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:32,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:32,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:32,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:32,266 INFO L87 Difference]: Start difference. First operand 585 states and 953 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:32,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:32,438 INFO L93 Difference]: Finished difference Result 1127 states and 1840 transitions. [2025-01-09 03:48:32,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:32,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2025-01-09 03:48:32,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:32,442 INFO L225 Difference]: With dead ends: 1127 [2025-01-09 03:48:32,443 INFO L226 Difference]: Without dead ends: 594 [2025-01-09 03:48:32,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-09 03:48:32,445 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 55 mSDsluCounter, 3611 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4521 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:32,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4521 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-01-09 03:48:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 585. [2025-01-09 03:48:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 454 states have (on average 1.6475770925110131) internal successors, (748), 475 states have internal predecessors, (748), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 03:48:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 949 transitions. [2025-01-09 03:48:32,461 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 949 transitions. Word has length 69 [2025-01-09 03:48:32,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:32,462 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 949 transitions. [2025-01-09 03:48:32,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 949 transitions. [2025-01-09 03:48:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 03:48:32,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:32,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:32,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:48:32,463 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:32,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:32,463 INFO L85 PathProgramCache]: Analyzing trace with hash -872852556, now seen corresponding path program 1 times [2025-01-09 03:48:32,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:32,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962235142] [2025-01-09 03:48:32,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:32,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:32,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 03:48:32,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 03:48:32,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:32,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:32,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:32,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962235142] [2025-01-09 03:48:32,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962235142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:32,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:32,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:32,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240252692] [2025-01-09 03:48:32,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:32,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:32,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:32,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:32,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:32,579 INFO L87 Difference]: Start difference. First operand 585 states and 949 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:32,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:32,721 INFO L93 Difference]: Finished difference Result 1127 states and 1836 transitions. [2025-01-09 03:48:32,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:32,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2025-01-09 03:48:32,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:32,725 INFO L225 Difference]: With dead ends: 1127 [2025-01-09 03:48:32,726 INFO L226 Difference]: Without dead ends: 594 [2025-01-09 03:48:32,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-09 03:48:32,728 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 54 mSDsluCounter, 3611 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4521 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:32,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4521 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-01-09 03:48:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 585. [2025-01-09 03:48:32,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 454 states have (on average 1.6387665198237886) internal successors, (744), 475 states have internal predecessors, (744), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 03:48:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 945 transitions. [2025-01-09 03:48:32,745 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 945 transitions. Word has length 70 [2025-01-09 03:48:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:32,745 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 945 transitions. [2025-01-09 03:48:32,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 945 transitions. [2025-01-09 03:48:32,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 03:48:32,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:32,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:32,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:48:32,746 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:32,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:32,746 INFO L85 PathProgramCache]: Analyzing trace with hash 465626873, now seen corresponding path program 1 times [2025-01-09 03:48:32,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:32,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844833531] [2025-01-09 03:48:32,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:32,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:32,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 03:48:32,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 03:48:32,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:32,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:32,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:32,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844833531] [2025-01-09 03:48:32,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844833531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:32,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:32,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:32,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225841627] [2025-01-09 03:48:32,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:32,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:32,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:32,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:32,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:32,840 INFO L87 Difference]: Start difference. First operand 585 states and 945 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:32,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:32,967 INFO L93 Difference]: Finished difference Result 1127 states and 1832 transitions. [2025-01-09 03:48:32,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:32,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-01-09 03:48:32,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:32,971 INFO L225 Difference]: With dead ends: 1127 [2025-01-09 03:48:32,971 INFO L226 Difference]: Without dead ends: 594 [2025-01-09 03:48:32,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-09 03:48:32,973 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 53 mSDsluCounter, 3594 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4503 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:32,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4503 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:32,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-01-09 03:48:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 585. [2025-01-09 03:48:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 454 states have (on average 1.6299559471365639) internal successors, (740), 475 states have internal predecessors, (740), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 03:48:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 941 transitions. [2025-01-09 03:48:32,988 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 941 transitions. Word has length 71 [2025-01-09 03:48:32,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:32,988 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 941 transitions. [2025-01-09 03:48:32,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 941 transitions. [2025-01-09 03:48:32,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 03:48:32,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:32,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:32,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:48:32,989 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:32,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:32,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1983912569, now seen corresponding path program 1 times [2025-01-09 03:48:32,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:32,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771884688] [2025-01-09 03:48:32,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:32,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:33,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 03:48:33,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 03:48:33,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:33,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:33,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:33,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771884688] [2025-01-09 03:48:33,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771884688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:33,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:33,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:33,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971948326] [2025-01-09 03:48:33,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:33,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:33,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:33,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:33,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:33,107 INFO L87 Difference]: Start difference. First operand 585 states and 941 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:33,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:33,157 INFO L93 Difference]: Finished difference Result 1118 states and 1814 transitions. [2025-01-09 03:48:33,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:33,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 71 [2025-01-09 03:48:33,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:33,162 INFO L225 Difference]: With dead ends: 1118 [2025-01-09 03:48:33,162 INFO L226 Difference]: Without dead ends: 564 [2025-01-09 03:48:33,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-01-09 03:48:33,165 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 84 mSDsluCounter, 4577 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5507 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:33,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5507 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:33,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-01-09 03:48:33,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-01-09 03:48:33,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 433 states have (on average 1.630484988452656) internal successors, (706), 454 states have internal predecessors, (706), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 03:48:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 907 transitions. [2025-01-09 03:48:33,180 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 907 transitions. Word has length 71 [2025-01-09 03:48:33,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:33,180 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 907 transitions. [2025-01-09 03:48:33,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 907 transitions. [2025-01-09 03:48:33,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 03:48:33,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:33,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:33,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:48:33,181 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:33,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:33,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1819686097, now seen corresponding path program 1 times [2025-01-09 03:48:33,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:33,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578953255] [2025-01-09 03:48:33,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:33,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:33,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 03:48:33,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 03:48:33,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:33,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:33,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:33,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578953255] [2025-01-09 03:48:33,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578953255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:33,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:33,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:33,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847427732] [2025-01-09 03:48:33,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:33,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:33,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:33,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:33,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:33,269 INFO L87 Difference]: Start difference. First operand 564 states and 907 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:33,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:33,329 INFO L93 Difference]: Finished difference Result 1097 states and 1780 transitions. [2025-01-09 03:48:33,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:33,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2025-01-09 03:48:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:33,333 INFO L225 Difference]: With dead ends: 1097 [2025-01-09 03:48:33,333 INFO L226 Difference]: Without dead ends: 564 [2025-01-09 03:48:33,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-09 03:48:33,336 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 17 mSDsluCounter, 3551 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4441 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:33,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4441 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-01-09 03:48:33,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-01-09 03:48:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 433 states have (on average 1.628175519630485) internal successors, (705), 454 states have internal predecessors, (705), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 03:48:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 906 transitions. [2025-01-09 03:48:33,353 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 906 transitions. Word has length 72 [2025-01-09 03:48:33,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:33,353 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 906 transitions. [2025-01-09 03:48:33,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:33,353 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 906 transitions. [2025-01-09 03:48:33,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 03:48:33,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:33,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:33,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:48:33,354 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:33,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:33,354 INFO L85 PathProgramCache]: Analyzing trace with hash -478446444, now seen corresponding path program 1 times [2025-01-09 03:48:33,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:33,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225797134] [2025-01-09 03:48:33,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:33,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:33,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 03:48:33,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 03:48:33,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:33,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:33,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:33,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225797134] [2025-01-09 03:48:33,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225797134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:33,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:33,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:33,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428892868] [2025-01-09 03:48:33,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:33,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:33,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:33,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:33,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:33,474 INFO L87 Difference]: Start difference. First operand 564 states and 906 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:33,528 INFO L93 Difference]: Finished difference Result 1097 states and 1779 transitions. [2025-01-09 03:48:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:33,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-01-09 03:48:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:33,533 INFO L225 Difference]: With dead ends: 1097 [2025-01-09 03:48:33,533 INFO L226 Difference]: Without dead ends: 564 [2025-01-09 03:48:33,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-09 03:48:33,536 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 16 mSDsluCounter, 3551 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4441 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:33,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4441 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-01-09 03:48:33,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-01-09 03:48:33,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 433 states have (on average 1.625866050808314) internal successors, (704), 454 states have internal predecessors, (704), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 03:48:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 905 transitions. [2025-01-09 03:48:33,554 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 905 transitions. Word has length 73 [2025-01-09 03:48:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:33,554 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 905 transitions. [2025-01-09 03:48:33,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:48:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 905 transitions. [2025-01-09 03:48:33,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 03:48:33,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:33,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:33,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:48:33,556 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:33,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:33,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1616774826, now seen corresponding path program 1 times [2025-01-09 03:48:33,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:33,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438547069] [2025-01-09 03:48:33,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:33,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:33,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 03:48:33,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 03:48:33,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:33,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:33,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:33,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438547069] [2025-01-09 03:48:33,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438547069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:33,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:33,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 03:48:33,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885966315] [2025-01-09 03:48:33,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:33,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:48:33,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:33,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:48:33,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:48:33,774 INFO L87 Difference]: Start difference. First operand 564 states and 905 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:33,920 INFO L93 Difference]: Finished difference Result 1091 states and 1767 transitions. [2025-01-09 03:48:33,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:48:33,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2025-01-09 03:48:33,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:33,924 INFO L225 Difference]: With dead ends: 1091 [2025-01-09 03:48:33,924 INFO L226 Difference]: Without dead ends: 564 [2025-01-09 03:48:33,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:48:33,926 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 6 mSDsluCounter, 7090 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7979 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:33,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7979 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:33,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-01-09 03:48:33,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-01-09 03:48:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 433 states have (on average 1.6235565819861433) internal successors, (703), 454 states have internal predecessors, (703), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 03:48:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 904 transitions. [2025-01-09 03:48:33,940 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 904 transitions. Word has length 74 [2025-01-09 03:48:33,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:33,940 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 904 transitions. [2025-01-09 03:48:33,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:48:33,941 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 904 transitions. [2025-01-09 03:48:33,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 03:48:33,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:33,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:33,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:48:33,942 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:33,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:33,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2046804831, now seen corresponding path program 1 times [2025-01-09 03:48:33,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:33,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917388416] [2025-01-09 03:48:33,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:33,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:33,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 03:48:33,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 03:48:33,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:33,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:34,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:34,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917388416] [2025-01-09 03:48:34,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917388416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:34,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:34,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:34,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321209230] [2025-01-09 03:48:34,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:34,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:34,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:34,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:34,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:34,121 INFO L87 Difference]: Start difference. First operand 564 states and 904 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-09 03:48:36,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:36,154 INFO L93 Difference]: Finished difference Result 1737 states and 2847 transitions. [2025-01-09 03:48:36,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:36,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 75 [2025-01-09 03:48:36,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:36,163 INFO L225 Difference]: With dead ends: 1737 [2025-01-09 03:48:36,164 INFO L226 Difference]: Without dead ends: 1218 [2025-01-09 03:48:36,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:36,167 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 3352 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 800 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3423 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 800 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:36,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3423 Valid, 962 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [800 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 03:48:36,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-01-09 03:48:36,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1086. [2025-01-09 03:48:36,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 841 states have (on average 1.643281807372176) internal successors, (1382), 871 states have internal predecessors, (1382), 193 states have call successors, (193), 50 states have call predecessors, (193), 51 states have return successors, (195), 177 states have call predecessors, (195), 188 states have call successors, (195) [2025-01-09 03:48:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1770 transitions. [2025-01-09 03:48:36,218 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1770 transitions. Word has length 75 [2025-01-09 03:48:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:36,218 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1770 transitions. [2025-01-09 03:48:36,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-09 03:48:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1770 transitions. [2025-01-09 03:48:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:48:36,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:36,221 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 03:48:36,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:48:36,222 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:36,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:36,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2027889596, now seen corresponding path program 1 times [2025-01-09 03:48:36,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:36,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017240784] [2025-01-09 03:48:36,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:36,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:36,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:48:36,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:48:36,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:36,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:36,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:36,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017240784] [2025-01-09 03:48:36,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017240784] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:36,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690358038] [2025-01-09 03:48:36,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:36,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:36,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:36,353 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:48:36,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:48:36,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:48:36,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:48:36,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:36,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:36,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 1718 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:36,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 03:48:36,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:36,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690358038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:36,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:36,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:48:36,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675392164] [2025-01-09 03:48:36,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:36,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:36,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:36,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:36,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:36,716 INFO L87 Difference]: Start difference. First operand 1086 states and 1770 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 03:48:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:36,777 INFO L93 Difference]: Finished difference Result 2730 states and 4499 transitions. [2025-01-09 03:48:36,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:36,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2025-01-09 03:48:36,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:36,786 INFO L225 Difference]: With dead ends: 2730 [2025-01-09 03:48:36,787 INFO L226 Difference]: Without dead ends: 1689 [2025-01-09 03:48:36,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 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-01-09 03:48:36,792 INFO L435 NwaCegarLoop]: 1023 mSDtfsCounter, 889 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:36,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 1866 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:36,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2025-01-09 03:48:36,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1687. [2025-01-09 03:48:36,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1302 states have (on average 1.6443932411674347) internal successors, (2141), 1348 states have internal predecessors, (2141), 304 states have call successors, (304), 76 states have call predecessors, (304), 80 states have return successors, (325), 287 states have call predecessors, (325), 299 states have call successors, (325) [2025-01-09 03:48:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2770 transitions. [2025-01-09 03:48:36,861 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2770 transitions. Word has length 130 [2025-01-09 03:48:36,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:36,861 INFO L471 AbstractCegarLoop]: Abstraction has 1687 states and 2770 transitions. [2025-01-09 03:48:36,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 03:48:36,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2770 transitions. [2025-01-09 03:48:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:48:36,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:36,865 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 03:48:36,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:48:37,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 03:48:37,066 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:37,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:37,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1559677055, now seen corresponding path program 1 times [2025-01-09 03:48:37,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:37,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568761542] [2025-01-09 03:48:37,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:37,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:37,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:48:37,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:48:37,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:37,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:37,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:37,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568761542] [2025-01-09 03:48:37,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568761542] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:37,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295008586] [2025-01-09 03:48:37,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:37,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:37,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:37,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:48:37,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:48:37,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:48:37,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:48:37,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:37,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:37,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 1720 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:37,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 03:48:37,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:37,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295008586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:37,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:37,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:48:37,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875552784] [2025-01-09 03:48:37,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:37,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:37,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:37,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:37,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:37,521 INFO L87 Difference]: Start difference. First operand 1687 states and 2770 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 03:48:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:37,624 INFO L93 Difference]: Finished difference Result 4535 states and 7527 transitions. [2025-01-09 03:48:37,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:37,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-01-09 03:48:37,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:37,639 INFO L225 Difference]: With dead ends: 4535 [2025-01-09 03:48:37,640 INFO L226 Difference]: Without dead ends: 2893 [2025-01-09 03:48:37,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 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-01-09 03:48:37,647 INFO L435 NwaCegarLoop]: 977 mSDtfsCounter, 888 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:37,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 1822 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:37,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2025-01-09 03:48:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2890. [2025-01-09 03:48:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2890 states, 2225 states have (on average 1.644943820224719) internal successors, (3660), 2303 states have internal predecessors, (3660), 526 states have call successors, (526), 128 states have call predecessors, (526), 138 states have return successors, (603), 507 states have call predecessors, (603), 521 states have call successors, (603) [2025-01-09 03:48:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 4789 transitions. [2025-01-09 03:48:37,753 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 4789 transitions. Word has length 131 [2025-01-09 03:48:37,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:37,754 INFO L471 AbstractCegarLoop]: Abstraction has 2890 states and 4789 transitions. [2025-01-09 03:48:37,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 03:48:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 4789 transitions. [2025-01-09 03:48:37,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:48:37,758 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:37,758 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 03:48:37,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:48:37,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 03:48:37,962 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:37,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:37,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1816090652, now seen corresponding path program 1 times [2025-01-09 03:48:37,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:37,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797774314] [2025-01-09 03:48:37,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:37,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:37,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:48:37,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:48:37,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:37,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 03:48:38,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:38,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797774314] [2025-01-09 03:48:38,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797774314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:38,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:38,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 03:48:38,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940203952] [2025-01-09 03:48:38,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:38,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:48:38,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:38,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:48:38,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:48:38,159 INFO L87 Difference]: Start difference. First operand 2890 states and 4789 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 03:48:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:43,209 INFO L93 Difference]: Finished difference Result 10613 states and 17662 transitions. [2025-01-09 03:48:43,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 03:48:43,210 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) Word has length 131 [2025-01-09 03:48:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:43,258 INFO L225 Difference]: With dead ends: 10613 [2025-01-09 03:48:43,259 INFO L226 Difference]: Without dead ends: 7768 [2025-01-09 03:48:43,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-01-09 03:48:43,280 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 2341 mSDsluCounter, 3506 mSDsCounter, 0 mSdLazyCounter, 10909 mSolverCounterSat, 665 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2419 SdHoareTripleChecker+Valid, 4165 SdHoareTripleChecker+Invalid, 11574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 10909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:43,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2419 Valid, 4165 Invalid, 11574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [665 Valid, 10909 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 03:48:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7768 states. [2025-01-09 03:48:43,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7768 to 7549. [2025-01-09 03:48:43,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7549 states, 5630 states have (on average 1.605328596802842) internal successors, (9038), 5844 states have internal predecessors, (9038), 1547 states have call successors, (1547), 315 states have call predecessors, (1547), 371 states have return successors, (1846), 1521 states have call predecessors, (1846), 1542 states have call successors, (1846) [2025-01-09 03:48:43,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7549 states to 7549 states and 12431 transitions. [2025-01-09 03:48:43,796 INFO L78 Accepts]: Start accepts. Automaton has 7549 states and 12431 transitions. Word has length 131 [2025-01-09 03:48:43,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:43,797 INFO L471 AbstractCegarLoop]: Abstraction has 7549 states and 12431 transitions. [2025-01-09 03:48:43,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 03:48:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 7549 states and 12431 transitions. [2025-01-09 03:48:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 03:48:43,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:43,801 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 03:48:43,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:48:43,802 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:43,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:43,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1105097446, now seen corresponding path program 1 times [2025-01-09 03:48:43,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:43,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473853448] [2025-01-09 03:48:43,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:43,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:43,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:48:43,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:48:43,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:43,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:43,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:43,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473853448] [2025-01-09 03:48:43,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473853448] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:43,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356439991] [2025-01-09 03:48:43,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:43,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:43,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:43,915 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:48:43,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:48:44,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:48:44,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:48:44,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:44,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:44,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 1722 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:44,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 03:48:44,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:44,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356439991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:44,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:44,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:48:44,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952973722] [2025-01-09 03:48:44,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:44,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:44,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:44,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:44,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:44,276 INFO L87 Difference]: Start difference. First operand 7549 states and 12431 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 03:48:44,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:44,632 INFO L93 Difference]: Finished difference Result 21360 states and 35756 transitions. [2025-01-09 03:48:44,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:44,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2025-01-09 03:48:44,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:44,705 INFO L225 Difference]: With dead ends: 21360 [2025-01-09 03:48:44,705 INFO L226 Difference]: Without dead ends: 13856 [2025-01-09 03:48:44,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 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-01-09 03:48:44,731 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 887 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:44,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1814 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:44,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13856 states. [2025-01-09 03:48:45,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13856 to 13852. [2025-01-09 03:48:45,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13852 states, 10309 states have (on average 1.601901251333786) internal successors, (16514), 10707 states have internal predecessors, (16514), 2863 states have call successors, (2863), 571 states have call predecessors, (2863), 679 states have return successors, (3772), 2837 states have call predecessors, (3772), 2858 states have call successors, (3772) [2025-01-09 03:48:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13852 states to 13852 states and 23149 transitions. [2025-01-09 03:48:45,450 INFO L78 Accepts]: Start accepts. Automaton has 13852 states and 23149 transitions. Word has length 132 [2025-01-09 03:48:45,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:45,450 INFO L471 AbstractCegarLoop]: Abstraction has 13852 states and 23149 transitions. [2025-01-09 03:48:45,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 03:48:45,452 INFO L276 IsEmpty]: Start isEmpty. Operand 13852 states and 23149 transitions. [2025-01-09 03:48:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 03:48:45,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:45,456 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 03:48:45,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:48:45,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:45,657 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:45,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:45,659 INFO L85 PathProgramCache]: Analyzing trace with hash -101964639, now seen corresponding path program 1 times [2025-01-09 03:48:45,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:45,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505651820] [2025-01-09 03:48:45,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:45,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:45,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 03:48:45,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 03:48:45,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:45,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:45,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:45,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505651820] [2025-01-09 03:48:45,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505651820] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:45,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531613246] [2025-01-09 03:48:45,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:45,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:45,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:45,783 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:48:45,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:48:45,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 03:48:46,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 03:48:46,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:46,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:46,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 1724 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:46,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 03:48:46,054 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:46,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531613246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:46,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:46,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:48:46,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607668746] [2025-01-09 03:48:46,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:46,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:46,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:46,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:46,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:46,055 INFO L87 Difference]: Start difference. First operand 13852 states and 23149 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 03:48:46,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:46,823 INFO L93 Difference]: Finished difference Result 40271 states and 68997 transitions. [2025-01-09 03:48:46,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:46,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-01-09 03:48:46,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:46,976 INFO L225 Difference]: With dead ends: 40271 [2025-01-09 03:48:46,976 INFO L226 Difference]: Without dead ends: 26464 [2025-01-09 03:48:47,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 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-01-09 03:48:47,031 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 886 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:47,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1809 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:47,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26464 states. [2025-01-09 03:48:48,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26464 to 26459. [2025-01-09 03:48:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26459 states, 19668 states have (on average 1.5984340044742729) internal successors, (31438), 20434 states have internal predecessors, (31438), 5495 states have call successors, (5495), 1083 states have call predecessors, (5495), 1295 states have return successors, (8314), 5469 states have call predecessors, (8314), 5490 states have call successors, (8314) [2025-01-09 03:48:48,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26459 states to 26459 states and 45247 transitions. [2025-01-09 03:48:48,305 INFO L78 Accepts]: Start accepts. Automaton has 26459 states and 45247 transitions. Word has length 133 [2025-01-09 03:48:48,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:48,306 INFO L471 AbstractCegarLoop]: Abstraction has 26459 states and 45247 transitions. [2025-01-09 03:48:48,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 03:48:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 26459 states and 45247 transitions. [2025-01-09 03:48:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 03:48:48,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:48,311 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 03:48:48,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:48:48,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:48,512 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:48,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:48,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1133820296, now seen corresponding path program 1 times [2025-01-09 03:48:48,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:48,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315016940] [2025-01-09 03:48:48,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:48,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:48,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 03:48:48,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 03:48:48,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:48,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:48,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:48,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315016940] [2025-01-09 03:48:48,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315016940] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:48,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664848501] [2025-01-09 03:48:48,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:48,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:48,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:48,648 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:48:48,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:48:48,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 03:48:48,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 03:48:48,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:48,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:48,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 1726 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:48,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 03:48:48,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:48,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664848501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:48,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:48,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:48:48,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571783185] [2025-01-09 03:48:48,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:48,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:48,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:48,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:48,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:48,966 INFO L87 Difference]: Start difference. First operand 26459 states and 45247 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 03:48:50,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:50,599 INFO L93 Difference]: Finished difference Result 78094 states and 139021 transitions. [2025-01-09 03:48:50,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:50,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2025-01-09 03:48:50,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:51,035 INFO L225 Difference]: With dead ends: 78094 [2025-01-09 03:48:51,036 INFO L226 Difference]: Without dead ends: 51672 [2025-01-09 03:48:51,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 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-01-09 03:48:51,207 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 885 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:51,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 1822 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51672 states. [2025-01-09 03:48:53,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51672 to 51666. [2025-01-09 03:48:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51666 states, 38380 states have (on average 1.5943981240229286) internal successors, (61193), 39882 states have internal predecessors, (61193), 10759 states have call successors, (10759), 2107 states have call predecessors, (10759), 2526 states have return successors, (19779), 10732 states have call predecessors, (19779), 10754 states have call successors, (19779) [2025-01-09 03:48:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51666 states to 51666 states and 91731 transitions. [2025-01-09 03:48:54,151 INFO L78 Accepts]: Start accepts. Automaton has 51666 states and 91731 transitions. Word has length 134 [2025-01-09 03:48:54,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:54,152 INFO L471 AbstractCegarLoop]: Abstraction has 51666 states and 91731 transitions. [2025-01-09 03:48:54,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 03:48:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 51666 states and 91731 transitions. [2025-01-09 03:48:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 03:48:54,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:54,174 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:54,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:48:54,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:54,379 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:54,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:54,380 INFO L85 PathProgramCache]: Analyzing trace with hash -187183045, now seen corresponding path program 1 times [2025-01-09 03:48:54,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:54,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085093057] [2025-01-09 03:48:54,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:54,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:54,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 03:48:54,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 03:48:54,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:54,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-09 03:48:54,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:54,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085093057] [2025-01-09 03:48:54,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085093057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:54,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:54,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:54,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929663467] [2025-01-09 03:48:54,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:54,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:54,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:54,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:54,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:54,546 INFO L87 Difference]: Start difference. First operand 51666 states and 91731 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 03:48:57,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:57,360 INFO L93 Difference]: Finished difference Result 103815 states and 194069 transitions. [2025-01-09 03:48:57,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:57,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) Word has length 204 [2025-01-09 03:48:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:57,820 INFO L225 Difference]: With dead ends: 103815 [2025-01-09 03:48:57,820 INFO L226 Difference]: Without dead ends: 52194 [2025-01-09 03:48:58,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:58,263 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 898 mSDsluCounter, 2425 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 3311 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:58,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 3311 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:48:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52194 states. [2025-01-09 03:49:00,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52194 to 52194. [2025-01-09 03:49:00,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52194 states, 38776 states have (on average 1.5883278316484424) internal successors, (61589), 40278 states have internal predecessors, (61589), 10759 states have call successors, (10759), 2239 states have call predecessors, (10759), 2658 states have return successors, (19878), 10732 states have call predecessors, (19878), 10754 states have call successors, (19878) [2025-01-09 03:49:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52194 states to 52194 states and 92226 transitions. [2025-01-09 03:49:01,081 INFO L78 Accepts]: Start accepts. Automaton has 52194 states and 92226 transitions. Word has length 204 [2025-01-09 03:49:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:01,082 INFO L471 AbstractCegarLoop]: Abstraction has 52194 states and 92226 transitions. [2025-01-09 03:49:01,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 03:49:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 52194 states and 92226 transitions. [2025-01-09 03:49:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 03:49:01,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:01,101 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:01,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:49:01,102 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:01,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:01,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1662480027, now seen corresponding path program 1 times [2025-01-09 03:49:01,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:01,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9487263] [2025-01-09 03:49:01,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:01,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:01,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 03:49:01,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 03:49:01,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:01,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-09 03:49:01,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:01,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9487263] [2025-01-09 03:49:01,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9487263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:01,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:01,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:49:01,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76905786] [2025-01-09 03:49:01,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:01,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:49:01,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:01,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:49:01,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:49:01,241 INFO L87 Difference]: Start difference. First operand 52194 states and 92226 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 03:49:04,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:04,352 INFO L93 Difference]: Finished difference Result 105003 states and 195026 transitions. [2025-01-09 03:49:04,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:49:04,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) Word has length 205 [2025-01-09 03:49:04,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:04,775 INFO L225 Difference]: With dead ends: 105003 [2025-01-09 03:49:04,775 INFO L226 Difference]: Without dead ends: 52854 [2025-01-09 03:49:05,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:49:05,104 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 897 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:05,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 3317 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 03:49:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52854 states. [2025-01-09 03:49:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52854 to 52854. [2025-01-09 03:49:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52854 states, 39304 states have (on average 1.5804243842865866) internal successors, (62117), 40806 states have internal predecessors, (62117), 10759 states have call successors, (10759), 2371 states have call predecessors, (10759), 2790 states have return successors, (19977), 10732 states have call predecessors, (19977), 10754 states have call successors, (19977) [2025-01-09 03:49:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52854 states to 52854 states and 92853 transitions. [2025-01-09 03:49:08,127 INFO L78 Accepts]: Start accepts. Automaton has 52854 states and 92853 transitions. Word has length 205 [2025-01-09 03:49:08,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:08,127 INFO L471 AbstractCegarLoop]: Abstraction has 52854 states and 92853 transitions. [2025-01-09 03:49:08,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 03:49:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 52854 states and 92853 transitions. [2025-01-09 03:49:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 03:49:08,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:08,145 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:08,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:49:08,146 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:08,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:08,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1656801865, now seen corresponding path program 1 times [2025-01-09 03:49:08,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:08,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103330246] [2025-01-09 03:49:08,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:08,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:08,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 03:49:08,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 03:49:08,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:08,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-09 03:49:08,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:08,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103330246] [2025-01-09 03:49:08,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103330246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:08,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:08,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:49:08,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459536602] [2025-01-09 03:49:08,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:08,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:49:08,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:08,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:49:08,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:49:08,538 INFO L87 Difference]: Start difference. First operand 52854 states and 92853 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 03:49:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:11,277 INFO L93 Difference]: Finished difference Result 106455 states and 196247 transitions. [2025-01-09 03:49:11,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:49:11,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) Word has length 206 [2025-01-09 03:49:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:11,651 INFO L225 Difference]: With dead ends: 106455 [2025-01-09 03:49:11,651 INFO L226 Difference]: Without dead ends: 53646 [2025-01-09 03:49:11,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:49:11,930 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 897 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:11,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 3317 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:49:11,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53646 states.