./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f20249a191004f50add5285446ee5ffba043f1ff9b40e0e115c641082e595e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:29:02,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:29:03,054 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:29:03,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:29:03,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:29:03,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:29:03,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:29:03,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:29:03,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:29:03,076 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:29:03,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:29:03,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:29:03,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:29:03,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:29:03,077 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:29:03,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:29:03,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:29:03,077 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:29:03,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:29:03,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:29:03,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:29:03,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:29:03,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:29:03,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:29:03,078 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:29:03,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:29:03,078 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:29:03,078 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:29:03,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:29:03,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:29:03,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:29:03,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:29:03,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:29:03,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:29:03,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:29:03,079 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:29:03,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:29:03,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:29:03,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:29:03,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:29:03,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:29:03,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:29:03,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:29:03,080 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f20249a191004f50add5285446ee5ffba043f1ff9b40e0e115c641082e595e2 [2025-03-08 05:29:03,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:29:03,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:29:03,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:29:03,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:29:03,321 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:29:03,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c [2025-03-08 05:29:04,437 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6aec4110/c8c8b94222b94c6cbbf3981c126f3a46/FLAGb438e2511 [2025-03-08 05:29:04,828 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:29:04,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c [2025-03-08 05:29:04,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6aec4110/c8c8b94222b94c6cbbf3981c126f3a46/FLAGb438e2511 [2025-03-08 05:29:05,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6aec4110/c8c8b94222b94c6cbbf3981c126f3a46 [2025-03-08 05:29:05,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:29:05,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:29:05,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:29:05,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:29:05,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:29:05,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:05" (1/1) ... [2025-03-08 05:29:05,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58fd9ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:05, skipping insertion in model container [2025-03-08 05:29:05,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:05" (1/1) ... [2025-03-08 05:29:05,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:29:05,227 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c[17414,17427] [2025-03-08 05:29:05,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:29:05,437 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:29:05,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2025-03-08 05:29:05,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [716] [2025-03-08 05:29:05,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [725] [2025-03-08 05:29:05,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [739] [2025-03-08 05:29:05,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [905] [2025-03-08 05:29:05,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2574] [2025-03-08 05:29:05,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2940] [2025-03-08 05:29:05,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2978] [2025-03-08 05:29:05,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3330] [2025-03-08 05:29:05,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3448] [2025-03-08 05:29:05,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c[17414,17427] [2025-03-08 05:29:05,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:29:05,565 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:29:05,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:05 WrapperNode [2025-03-08 05:29:05,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:29:05,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:29:05,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:29:05,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:29:05,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:05" (1/1) ... [2025-03-08 05:29:05,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:05" (1/1) ... [2025-03-08 05:29:05,640 INFO L138 Inliner]: procedures = 99, calls = 352, calls flagged for inlining = 28, calls inlined = 24, statements flattened = 930 [2025-03-08 05:29:05,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:29:05,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:29:05,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:29:05,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:29:05,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:05" (1/1) ... [2025-03-08 05:29:05,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:05" (1/1) ... [2025-03-08 05:29:05,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:05" (1/1) ... [2025-03-08 05:29:05,686 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-08 05:29:05,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:05" (1/1) ... [2025-03-08 05:29:05,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:05" (1/1) ... [2025-03-08 05:29:05,704 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:05" (1/1) ... [2025-03-08 05:29:05,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:05" (1/1) ... [2025-03-08 05:29:05,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:05" (1/1) ... [2025-03-08 05:29:05,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:05" (1/1) ... [2025-03-08 05:29:05,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:29:05,727 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:29:05,727 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:29:05,727 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:29:05,728 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:05" (1/1) ... [2025-03-08 05:29:05,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:29:05,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:05,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:29:05,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:29:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:29:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:29:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:29:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:29:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:29:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:29:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-03-08 05:29:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-03-08 05:29:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:29:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:29:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:29:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:29:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:29:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:29:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-08 05:29:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-08 05:29:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-08 05:29:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-08 05:29:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:29:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:29:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:29:05,785 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:29:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-08 05:29:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-08 05:29:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-08 05:29:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:29:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:29:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-08 05:29:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:29:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:29:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:29:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:29:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:29:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:29:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:29:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-03-08 05:29:05,786 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:29:05,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:29:05,787 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:29:05,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:29:05,787 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:29:05,787 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2025-03-08 05:29:05,787 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2025-03-08 05:29:05,930 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:29:05,934 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:29:06,010 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1887: #res#1 := ~retValue_acc~16#1; [2025-03-08 05:29:06,010 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~15#1; [2025-03-08 05:29:06,034 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3367: #res := ~retValue_acc~29; [2025-03-08 05:29:06,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2562: #res := ~retValue_acc~20; [2025-03-08 05:29:06,125 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1803-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~14#1; [2025-03-08 05:29:06,125 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1740-1: stopRequestedInDirection__wrappee__twothirdsfull_#res#1 := stopRequestedInDirection__wrappee__twothirdsfull_~retValue_acc~12#1; [2025-03-08 05:29:06,125 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1769: #res#1 := ~retValue_acc~13#1; [2025-03-08 05:29:06,131 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1932: #res := ~retValue_acc~18; [2025-03-08 05:29:06,282 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1700: #res := ~retValue_acc~11; [2025-03-08 05:29:06,400 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1335-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~9#1; [2025-03-08 05:29:06,401 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1348-1: isIdle_#res#1 := isIdle_~retValue_acc~10#1; [2025-03-08 05:29:06,402 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1172: #res := ~retValue_acc~5; [2025-03-08 05:29:06,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: #res := ~retValue_acc~2; [2025-03-08 05:29:06,418 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3445: #res := ~retValue_acc~31; [2025-03-08 05:29:06,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L986: #res := ~retValue_acc~3; [2025-03-08 05:29:06,425 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1163: #res := ~retValue_acc~4; [2025-03-08 05:29:06,544 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3406: #res := ~retValue_acc~30; [2025-03-08 05:29:06,561 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255: #res := ~retValue_acc~8; [2025-03-08 05:29:06,570 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1206: #res := ~retValue_acc~6; [2025-03-08 05:29:06,659 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L402: #res := ~retValue_acc~1; [2025-03-08 05:29:06,731 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975-1: valid_product_#res#1 := valid_product_~retValue_acc~26#1; [2025-03-08 05:29:06,731 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3327-1: main_#res#1 := main_~retValue_acc~28#1; [2025-03-08 05:29:06,740 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: #res := ~retValue_acc~0; [2025-03-08 05:29:06,811 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1918-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~17#1; [2025-03-08 05:29:06,941 INFO L? ?]: Removed 478 outVars from TransFormulas that were not future-live. [2025-03-08 05:29:06,941 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:29:06,961 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:29:06,961 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:29:06,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:06 BoogieIcfgContainer [2025-03-08 05:29:06,962 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:29:06,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:29:06,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:29:06,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:29:06,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:29:05" (1/3) ... [2025-03-08 05:29:06,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67287860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:06, skipping insertion in model container [2025-03-08 05:29:06,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:05" (2/3) ... [2025-03-08 05:29:06,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67287860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:06, skipping insertion in model container [2025-03-08 05:29:06,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:06" (3/3) ... [2025-03-08 05:29:06,974 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product32.cil.c [2025-03-08 05:29:06,983 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:29:06,986 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product32.cil.c that has 29 procedures, 598 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:29:07,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:29:07,041 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;@97edd67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:29:07,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:29:07,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 598 states, 465 states have (on average 1.6774193548387097) internal successors, (780), 488 states have internal predecessors, (780), 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-03-08 05:29:07,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 05:29:07,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:07,055 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-03-08 05:29:07,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:07,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:07,060 INFO L85 PathProgramCache]: Analyzing trace with hash -304652281, now seen corresponding path program 1 times [2025-03-08 05:29:07,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:07,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278113703] [2025-03-08 05:29:07,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:07,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:07,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 05:29:07,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 05:29:07,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:07,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:07,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:07,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278113703] [2025-03-08 05:29:07,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278113703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:07,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:07,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:29:07,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025737847] [2025-03-08 05:29:07,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:07,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:29:07,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:07,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:29:07,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:29:07,551 INFO L87 Difference]: Start difference. First operand has 598 states, 465 states have (on average 1.6774193548387097) internal successors, (780), 488 states have internal predecessors, (780), 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-03-08 05:29:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:07,681 INFO L93 Difference]: Finished difference Result 1176 states and 1947 transitions. [2025-03-08 05:29:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:29:07,683 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-03-08 05:29:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:07,701 INFO L225 Difference]: With dead ends: 1176 [2025-03-08 05:29:07,702 INFO L226 Difference]: Without dead ends: 590 [2025-03-08 05:29:07,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:29:07,711 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 5 mSDsluCounter, 1928 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2894 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-03-08 05:29:07,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2894 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:07,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-08 05:29:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-03-08 05:29:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 459 states have (on average 1.6753812636165577) internal successors, (769), 480 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-03-08 05:29:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 970 transitions. [2025-03-08 05:29:07,784 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 970 transitions. Word has length 62 [2025-03-08 05:29:07,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:07,785 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 970 transitions. [2025-03-08 05:29:07,785 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-03-08 05:29:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 970 transitions. [2025-03-08 05:29:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 05:29:07,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:07,791 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-03-08 05:29:07,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:29:07,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:07,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:07,792 INFO L85 PathProgramCache]: Analyzing trace with hash 455204249, now seen corresponding path program 1 times [2025-03-08 05:29:07,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:07,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191558609] [2025-03-08 05:29:07,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:07,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:07,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 05:29:07,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 05:29:07,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:07,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:07,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:07,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191558609] [2025-03-08 05:29:07,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191558609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:07,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:07,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:29:07,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81141866] [2025-03-08 05:29:07,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:07,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:29:07,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:07,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:29:07,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:29:07,970 INFO L87 Difference]: Start difference. First operand 590 states and 970 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-03-08 05:29:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:08,039 INFO L93 Difference]: Finished difference Result 1162 states and 1917 transitions. [2025-03-08 05:29:08,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:29:08,040 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-03-08 05:29:08,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:08,045 INFO L225 Difference]: With dead ends: 1162 [2025-03-08 05:29:08,045 INFO L226 Difference]: Without dead ends: 590 [2025-03-08 05:29:08,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:29:08,048 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 4 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2873 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-03-08 05:29:08,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2873 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-08 05:29:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-03-08 05:29:08,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 459 states have (on average 1.673202614379085) internal successors, (768), 480 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-03-08 05:29:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 969 transitions. [2025-03-08 05:29:08,086 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 969 transitions. Word has length 64 [2025-03-08 05:29:08,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:08,086 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 969 transitions. [2025-03-08 05:29:08,087 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-03-08 05:29:08,087 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 969 transitions. [2025-03-08 05:29:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:29:08,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:08,090 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-03-08 05:29:08,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:29:08,091 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:08,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:08,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1038821388, now seen corresponding path program 1 times [2025-03-08 05:29:08,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:08,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214590271] [2025-03-08 05:29:08,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:08,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:08,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 05:29:08,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:29:08,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:08,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:08,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:08,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214590271] [2025-03-08 05:29:08,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214590271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:08,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:08,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:29:08,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448253396] [2025-03-08 05:29:08,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:08,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:29:08,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:08,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:29:08,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:29:08,248 INFO L87 Difference]: Start difference. First operand 590 states and 969 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-03-08 05:29:08,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:08,298 INFO L93 Difference]: Finished difference Result 1162 states and 1916 transitions. [2025-03-08 05:29:08,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:29:08,298 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-03-08 05:29:08,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:08,304 INFO L225 Difference]: With dead ends: 1162 [2025-03-08 05:29:08,304 INFO L226 Difference]: Without dead ends: 590 [2025-03-08 05:29:08,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:29:08,307 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 3 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2873 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-03-08 05:29:08,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2873 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:08,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-08 05:29:08,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-03-08 05:29:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 459 states have (on average 1.671023965141612) internal successors, (767), 480 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-03-08 05:29:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 968 transitions. [2025-03-08 05:29:08,330 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 968 transitions. Word has length 65 [2025-03-08 05:29:08,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:08,330 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 968 transitions. [2025-03-08 05:29:08,331 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-03-08 05:29:08,331 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 968 transitions. [2025-03-08 05:29:08,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 05:29:08,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:08,332 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-03-08 05:29:08,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:29:08,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:08,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash -514125316, now seen corresponding path program 1 times [2025-03-08 05:29:08,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:08,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87433831] [2025-03-08 05:29:08,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:08,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:08,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 05:29:08,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 05:29:08,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:08,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:08,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87433831] [2025-03-08 05:29:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87433831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:08,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:08,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:29:08,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237514367] [2025-03-08 05:29:08,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:08,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:29:08,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:08,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:29:08,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:29:08,461 INFO L87 Difference]: Start difference. First operand 590 states and 968 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-03-08 05:29:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:08,519 INFO L93 Difference]: Finished difference Result 1162 states and 1915 transitions. [2025-03-08 05:29:08,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:29:08,520 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-03-08 05:29:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:08,524 INFO L225 Difference]: With dead ends: 1162 [2025-03-08 05:29:08,525 INFO L226 Difference]: Without dead ends: 590 [2025-03-08 05:29:08,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:29:08,527 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 2 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2873 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-03-08 05:29:08,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2873 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:08,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-08 05:29:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-03-08 05:29:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 459 states have (on average 1.6688453159041394) internal successors, (766), 480 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-03-08 05:29:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 967 transitions. [2025-03-08 05:29:08,557 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 967 transitions. Word has length 66 [2025-03-08 05:29:08,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:08,557 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 967 transitions. [2025-03-08 05:29:08,558 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-03-08 05:29:08,558 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 967 transitions. [2025-03-08 05:29:08,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:29:08,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:08,559 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-03-08 05:29:08,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:29:08,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:08,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:08,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1833565705, now seen corresponding path program 1 times [2025-03-08 05:29:08,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:08,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969455013] [2025-03-08 05:29:08,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:08,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:08,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:29:08,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:29:08,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:08,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:08,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:08,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969455013] [2025-03-08 05:29:08,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969455013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:08,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:08,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:29:08,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60609616] [2025-03-08 05:29:08,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:08,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:29:08,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:08,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:29:08,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:29:08,677 INFO L87 Difference]: Start difference. First operand 590 states and 967 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-03-08 05:29:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:08,717 INFO L93 Difference]: Finished difference Result 1162 states and 1914 transitions. [2025-03-08 05:29:08,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:29:08,721 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-03-08 05:29:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:08,726 INFO L225 Difference]: With dead ends: 1162 [2025-03-08 05:29:08,726 INFO L226 Difference]: Without dead ends: 590 [2025-03-08 05:29:08,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:29:08,730 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 1 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2873 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-03-08 05:29:08,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2873 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-08 05:29:08,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-03-08 05:29:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 459 states have (on average 1.6666666666666667) internal successors, (765), 480 states have internal predecessors, (765), 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-03-08 05:29:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 966 transitions. [2025-03-08 05:29:08,760 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 966 transitions. Word has length 67 [2025-03-08 05:29:08,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:08,760 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 966 transitions. [2025-03-08 05:29:08,760 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-03-08 05:29:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 966 transitions. [2025-03-08 05:29:08,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:29:08,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:08,762 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-03-08 05:29:08,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:29:08,763 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:08,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:08,763 INFO L85 PathProgramCache]: Analyzing trace with hash -191694241, now seen corresponding path program 1 times [2025-03-08 05:29:08,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:08,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832324852] [2025-03-08 05:29:08,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:08,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:08,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:29:08,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:29:08,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:08,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:08,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:08,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832324852] [2025-03-08 05:29:08,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832324852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:08,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:08,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:29:08,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927188680] [2025-03-08 05:29:08,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:08,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:29:08,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:08,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:29:08,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:08,958 INFO L87 Difference]: Start difference. First operand 590 states and 966 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 6 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-03-08 05:29:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:09,049 INFO L93 Difference]: Finished difference Result 1128 states and 1846 transitions. [2025-03-08 05:29:09,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:29:09,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 6 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-03-08 05:29:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:09,056 INFO L225 Difference]: With dead ends: 1128 [2025-03-08 05:29:09,056 INFO L226 Difference]: Without dead ends: 605 [2025-03-08 05:29:09,059 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-03-08 05:29:09,059 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 91 mSDsluCounter, 4699 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5655 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:09,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5655 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-08 05:29:09,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2025-03-08 05:29:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 469 states have (on average 1.6631130063965884) internal successors, (780), 492 states have internal predecessors, (780), 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-03-08 05:29:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 985 transitions. [2025-03-08 05:29:09,089 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 985 transitions. Word has length 68 [2025-03-08 05:29:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:09,089 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 985 transitions. [2025-03-08 05:29:09,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 6 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-03-08 05:29:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 985 transitions. [2025-03-08 05:29:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:29:09,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:09,091 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-03-08 05:29:09,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:29:09,092 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:09,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:09,092 INFO L85 PathProgramCache]: Analyzing trace with hash 941496352, now seen corresponding path program 1 times [2025-03-08 05:29:09,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:09,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730849912] [2025-03-08 05:29:09,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:09,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:09,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:29:09,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:29:09,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:09,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:09,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:09,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730849912] [2025-03-08 05:29:09,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730849912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:09,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:09,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:29:09,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843350953] [2025-03-08 05:29:09,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:09,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:29:09,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:09,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:29:09,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:29:09,173 INFO L87 Difference]: Start difference. First operand 603 states and 985 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-03-08 05:29:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:09,209 INFO L93 Difference]: Finished difference Result 1180 states and 1940 transitions. [2025-03-08 05:29:09,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:29:09,209 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-03-08 05:29:09,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:09,213 INFO L225 Difference]: With dead ends: 1180 [2025-03-08 05:29:09,214 INFO L226 Difference]: Without dead ends: 584 [2025-03-08 05:29:09,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:29:09,217 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 0 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2875 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-03-08 05:29:09,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2875 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-08 05:29:09,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2025-03-08 05:29:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 453 states have (on average 1.6578366445916115) internal successors, (751), 474 states have internal predecessors, (751), 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-03-08 05:29:09,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 952 transitions. [2025-03-08 05:29:09,236 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 952 transitions. Word has length 68 [2025-03-08 05:29:09,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:09,236 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 952 transitions. [2025-03-08 05:29:09,236 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-03-08 05:29:09,236 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 952 transitions. [2025-03-08 05:29:09,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 05:29:09,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:09,237 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-03-08 05:29:09,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:29:09,237 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:09,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:09,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1746452114, now seen corresponding path program 1 times [2025-03-08 05:29:09,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:09,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033253640] [2025-03-08 05:29:09,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:09,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:09,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:29:09,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:29:09,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:09,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:09,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:09,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033253640] [2025-03-08 05:29:09,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033253640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:09,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:09,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:09,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924796389] [2025-03-08 05:29:09,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:09,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:09,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:09,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:09,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:09,388 INFO L87 Difference]: Start difference. First operand 584 states and 952 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-03-08 05:29:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:09,528 INFO L93 Difference]: Finished difference Result 1125 states and 1838 transitions. [2025-03-08 05:29:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:29:09,528 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-03-08 05:29:09,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:09,532 INFO L225 Difference]: With dead ends: 1125 [2025-03-08 05:29:09,532 INFO L226 Difference]: Without dead ends: 593 [2025-03-08 05:29:09,533 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-03-08 05:29:09,534 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 55 mSDsluCounter, 3607 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4516 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-03-08 05:29:09,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4516 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:29:09,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-08 05:29:09,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 584. [2025-03-08 05:29:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 453 states have (on average 1.6490066225165563) internal successors, (747), 474 states have internal predecessors, (747), 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-03-08 05:29:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 948 transitions. [2025-03-08 05:29:09,552 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 948 transitions. Word has length 69 [2025-03-08 05:29:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:09,552 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 948 transitions. [2025-03-08 05:29:09,552 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-03-08 05:29:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 948 transitions. [2025-03-08 05:29:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 05:29:09,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:09,554 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-03-08 05:29:09,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:29:09,554 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:09,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash 909546184, now seen corresponding path program 1 times [2025-03-08 05:29:09,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:09,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613685360] [2025-03-08 05:29:09,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:09,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:09,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 05:29:09,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 05:29:09,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:09,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:09,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:09,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613685360] [2025-03-08 05:29:09,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613685360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:09,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:09,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:09,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759388122] [2025-03-08 05:29:09,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:09,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:09,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:09,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:09,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:09,674 INFO L87 Difference]: Start difference. First operand 584 states and 948 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-03-08 05:29:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:09,802 INFO L93 Difference]: Finished difference Result 1125 states and 1834 transitions. [2025-03-08 05:29:09,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:29:09,803 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-03-08 05:29:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:09,807 INFO L225 Difference]: With dead ends: 1125 [2025-03-08 05:29:09,807 INFO L226 Difference]: Without dead ends: 593 [2025-03-08 05:29:09,809 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-03-08 05:29:09,810 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 54 mSDsluCounter, 3607 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4516 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-03-08 05:29:09,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4516 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:29:09,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-08 05:29:09,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 584. [2025-03-08 05:29:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 453 states have (on average 1.640176600441501) internal successors, (743), 474 states have internal predecessors, (743), 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-03-08 05:29:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 944 transitions. [2025-03-08 05:29:09,826 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 944 transitions. Word has length 70 [2025-03-08 05:29:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:09,826 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 944 transitions. [2025-03-08 05:29:09,826 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-03-08 05:29:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 944 transitions. [2025-03-08 05:29:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 05:29:09,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:09,827 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-03-08 05:29:09,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:29:09,827 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:09,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:09,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1182914129, now seen corresponding path program 1 times [2025-03-08 05:29:09,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:09,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594641835] [2025-03-08 05:29:09,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:09,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:09,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 05:29:09,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 05:29:09,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:09,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:09,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:09,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594641835] [2025-03-08 05:29:09,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594641835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:09,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:09,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:09,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027709960] [2025-03-08 05:29:09,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:09,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:09,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:09,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:09,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:09,913 INFO L87 Difference]: Start difference. First operand 584 states and 944 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-03-08 05:29:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:10,045 INFO L93 Difference]: Finished difference Result 1125 states and 1830 transitions. [2025-03-08 05:29:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:29:10,045 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-03-08 05:29:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:10,050 INFO L225 Difference]: With dead ends: 1125 [2025-03-08 05:29:10,051 INFO L226 Difference]: Without dead ends: 593 [2025-03-08 05:29:10,053 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-03-08 05:29:10,054 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 53 mSDsluCounter, 3590 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4498 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-03-08 05:29:10,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4498 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:29:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-08 05:29:10,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 584. [2025-03-08 05:29:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 453 states have (on average 1.6313465783664458) internal successors, (739), 474 states have internal predecessors, (739), 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-03-08 05:29:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 940 transitions. [2025-03-08 05:29:10,074 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 940 transitions. Word has length 71 [2025-03-08 05:29:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:10,074 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 940 transitions. [2025-03-08 05:29:10,074 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-03-08 05:29:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 940 transitions. [2025-03-08 05:29:10,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 05:29:10,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:10,076 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-03-08 05:29:10,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:29:10,076 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:10,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:10,077 INFO L85 PathProgramCache]: Analyzing trace with hash 700189472, now seen corresponding path program 1 times [2025-03-08 05:29:10,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:10,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941806994] [2025-03-08 05:29:10,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:10,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:10,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 05:29:10,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 05:29:10,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:10,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:10,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:10,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941806994] [2025-03-08 05:29:10,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941806994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:10,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:10,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:29:10,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801569185] [2025-03-08 05:29:10,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:10,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:29:10,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:10,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:29:10,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:10,176 INFO L87 Difference]: Start difference. First operand 584 states and 940 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-03-08 05:29:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:10,244 INFO L93 Difference]: Finished difference Result 1116 states and 1812 transitions. [2025-03-08 05:29:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:29:10,246 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-03-08 05:29:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:10,249 INFO L225 Difference]: With dead ends: 1116 [2025-03-08 05:29:10,249 INFO L226 Difference]: Without dead ends: 563 [2025-03-08 05:29:10,251 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-03-08 05:29:10,252 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 84 mSDsluCounter, 4572 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5501 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-03-08 05:29:10,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5501 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:10,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-08 05:29:10,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-03-08 05:29:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 432 states have (on average 1.6319444444444444) internal successors, (705), 453 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-03-08 05:29:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 906 transitions. [2025-03-08 05:29:10,267 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 906 transitions. Word has length 71 [2025-03-08 05:29:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:10,268 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 906 transitions. [2025-03-08 05:29:10,268 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-03-08 05:29:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 906 transitions. [2025-03-08 05:29:10,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 05:29:10,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:10,269 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-03-08 05:29:10,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:29:10,269 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:10,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:10,270 INFO L85 PathProgramCache]: Analyzing trace with hash 752112645, now seen corresponding path program 1 times [2025-03-08 05:29:10,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:10,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595807520] [2025-03-08 05:29:10,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:10,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:10,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 05:29:10,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 05:29:10,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:10,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:10,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:10,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595807520] [2025-03-08 05:29:10,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595807520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:10,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:10,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:10,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866891583] [2025-03-08 05:29:10,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:10,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:10,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:10,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:10,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:10,359 INFO L87 Difference]: Start difference. First operand 563 states and 906 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-03-08 05:29:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:10,416 INFO L93 Difference]: Finished difference Result 1095 states and 1778 transitions. [2025-03-08 05:29:10,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:29:10,416 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-03-08 05:29:10,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:10,420 INFO L225 Difference]: With dead ends: 1095 [2025-03-08 05:29:10,420 INFO L226 Difference]: Without dead ends: 563 [2025-03-08 05:29:10,422 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-03-08 05:29:10,423 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 17 mSDsluCounter, 3547 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4436 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-03-08 05:29:10,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4436 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-08 05:29:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-03-08 05:29:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 432 states have (on average 1.6296296296296295) internal successors, (704), 453 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-03-08 05:29:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 905 transitions. [2025-03-08 05:29:10,438 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 905 transitions. Word has length 72 [2025-03-08 05:29:10,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:10,439 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 905 transitions. [2025-03-08 05:29:10,439 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-03-08 05:29:10,439 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 905 transitions. [2025-03-08 05:29:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 05:29:10,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:10,440 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-03-08 05:29:10,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:29:10,440 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:10,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1309779764, now seen corresponding path program 1 times [2025-03-08 05:29:10,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:10,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115854700] [2025-03-08 05:29:10,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:10,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:10,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 05:29:10,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 05:29:10,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:10,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:10,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:10,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115854700] [2025-03-08 05:29:10,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115854700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:10,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:10,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:10,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006396451] [2025-03-08 05:29:10,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:10,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:10,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:10,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:10,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:10,538 INFO L87 Difference]: Start difference. First operand 563 states and 905 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-03-08 05:29:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:10,596 INFO L93 Difference]: Finished difference Result 1095 states and 1777 transitions. [2025-03-08 05:29:10,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:29:10,597 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-03-08 05:29:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:10,600 INFO L225 Difference]: With dead ends: 1095 [2025-03-08 05:29:10,601 INFO L226 Difference]: Without dead ends: 563 [2025-03-08 05:29:10,603 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-03-08 05:29:10,603 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 16 mSDsluCounter, 3547 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4436 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-03-08 05:29:10,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4436 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:10,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-08 05:29:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-03-08 05:29:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 432 states have (on average 1.6273148148148149) internal successors, (703), 453 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-03-08 05:29:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 904 transitions. [2025-03-08 05:29:10,619 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 904 transitions. Word has length 73 [2025-03-08 05:29:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:10,619 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 904 transitions. [2025-03-08 05:29:10,619 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-03-08 05:29:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 904 transitions. [2025-03-08 05:29:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 05:29:10,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:10,620 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-03-08 05:29:10,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:29:10,620 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:10,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1572852034, now seen corresponding path program 1 times [2025-03-08 05:29:10,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:10,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425192613] [2025-03-08 05:29:10,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:10,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:10,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 05:29:10,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 05:29:10,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:10,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:10,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:10,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425192613] [2025-03-08 05:29:10,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425192613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:10,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:10,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:29:10,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695874267] [2025-03-08 05:29:10,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:10,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:29:10,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:10,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:29:10,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:29:10,689 INFO L87 Difference]: Start difference. First operand 563 states and 904 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:29:10,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:10,719 INFO L93 Difference]: Finished difference Result 1089 states and 1765 transitions. [2025-03-08 05:29:10,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:29:10,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-08 05:29:10,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:10,724 INFO L225 Difference]: With dead ends: 1089 [2025-03-08 05:29:10,724 INFO L226 Difference]: Without dead ends: 563 [2025-03-08 05:29:10,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:29:10,727 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 5 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2666 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:10,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2666 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-08 05:29:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-03-08 05:29:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 432 states have (on average 1.625) internal successors, (702), 453 states have internal predecessors, (702), 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-03-08 05:29:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 903 transitions. [2025-03-08 05:29:10,744 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 903 transitions. Word has length 74 [2025-03-08 05:29:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:10,745 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 903 transitions. [2025-03-08 05:29:10,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:29:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 903 transitions. [2025-03-08 05:29:10,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 05:29:10,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:10,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, 1, 1, 1, 1] [2025-03-08 05:29:10,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:29:10,747 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:10,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:10,748 INFO L85 PathProgramCache]: Analyzing trace with hash -910197319, now seen corresponding path program 1 times [2025-03-08 05:29:10,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:10,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242524809] [2025-03-08 05:29:10,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:10,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:10,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 05:29:10,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 05:29:10,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:10,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:10,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:10,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:10,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242524809] [2025-03-08 05:29:10,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242524809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:10,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:10,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:10,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435355546] [2025-03-08 05:29:10,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:10,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:10,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:10,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:10,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:10,928 INFO L87 Difference]: Start difference. First operand 563 states and 903 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-03-08 05:29:12,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:12,845 INFO L93 Difference]: Finished difference Result 1734 states and 2844 transitions. [2025-03-08 05:29:12,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:29:12,846 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-03-08 05:29:12,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:12,856 INFO L225 Difference]: With dead ends: 1734 [2025-03-08 05:29:12,857 INFO L226 Difference]: Without dead ends: 1216 [2025-03-08 05:29:12,860 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-03-08 05:29:12,861 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 2051 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 2146 mSolverCounterSat, 447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2122 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 2146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:12,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2122 Valid, 1245 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [447 Valid, 2146 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 05:29:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-03-08 05:29:12,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1084. [2025-03-08 05:29:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 839 states have (on average 1.6448152562574494) internal successors, (1380), 869 states have internal predecessors, (1380), 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-03-08 05:29:12,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1768 transitions. [2025-03-08 05:29:12,914 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1768 transitions. Word has length 75 [2025-03-08 05:29:12,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:12,914 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1768 transitions. [2025-03-08 05:29:12,914 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-03-08 05:29:12,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1768 transitions. [2025-03-08 05:29:12,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 05:29:12,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:12,933 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-03-08 05:29:12,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:29:12,933 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:12,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:12,934 INFO L85 PathProgramCache]: Analyzing trace with hash -180848879, now seen corresponding path program 1 times [2025-03-08 05:29:12,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:12,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535684654] [2025-03-08 05:29:12,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:12,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 05:29:12,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 05:29:12,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:12,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:29:13,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:13,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535684654] [2025-03-08 05:29:13,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535684654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:13,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135210469] [2025-03-08 05:29:13,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:13,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:13,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:13,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:13,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:29:13,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 05:29:13,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 05:29:13,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:13,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:13,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 1718 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:29:13,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:29:13,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:13,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135210469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:13,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:13,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:29:13,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111756864] [2025-03-08 05:29:13,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:13,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:13,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:13,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:13,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:13,434 INFO L87 Difference]: Start difference. First operand 1084 states and 1768 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-03-08 05:29:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:13,494 INFO L93 Difference]: Finished difference Result 2725 states and 4494 transitions. [2025-03-08 05:29:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:13,495 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-03-08 05:29:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:13,504 INFO L225 Difference]: With dead ends: 2725 [2025-03-08 05:29:13,504 INFO L226 Difference]: Without dead ends: 1686 [2025-03-08 05:29:13,509 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-03-08 05:29:13,510 INFO L435 NwaCegarLoop]: 1022 mSDtfsCounter, 888 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 1864 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-03-08 05:29:13,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 1864 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:13,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2025-03-08 05:29:13,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1684. [2025-03-08 05:29:13,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1299 states have (on average 1.6458814472671286) internal successors, (2138), 1345 states have internal predecessors, (2138), 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-03-08 05:29:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2767 transitions. [2025-03-08 05:29:13,573 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2767 transitions. Word has length 130 [2025-03-08 05:29:13,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:13,573 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2767 transitions. [2025-03-08 05:29:13,573 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-03-08 05:29:13,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2767 transitions. [2025-03-08 05:29:13,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 05:29:13,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:13,576 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-03-08 05:29:13,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:29:13,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 05:29:13,781 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:13,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:13,782 INFO L85 PathProgramCache]: Analyzing trace with hash -204972466, now seen corresponding path program 1 times [2025-03-08 05:29:13,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:13,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161328650] [2025-03-08 05:29:13,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:13,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:13,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 05:29:13,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 05:29:13,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:13,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:29:14,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:14,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161328650] [2025-03-08 05:29:14,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161328650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:14,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:14,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 05:29:14,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935350076] [2025-03-08 05:29:14,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:14,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 05:29:14,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:14,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 05:29:14,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:29:14,131 INFO L87 Difference]: Start difference. First operand 1684 states and 2767 transitions. Second operand has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-08 05:29:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:19,842 INFO L93 Difference]: Finished difference Result 6160 states and 10141 transitions. [2025-03-08 05:29:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 05:29:19,843 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 130 [2025-03-08 05:29:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:19,866 INFO L225 Difference]: With dead ends: 6160 [2025-03-08 05:29:19,866 INFO L226 Difference]: Without dead ends: 4521 [2025-03-08 05:29:19,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 05:29:19,875 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 2370 mSDsluCounter, 5906 mSDsCounter, 0 mSdLazyCounter, 14305 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2448 SdHoareTripleChecker+Valid, 6587 SdHoareTripleChecker+Invalid, 14980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 14305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:19,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2448 Valid, 6587 Invalid, 14980 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [675 Valid, 14305 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-08 05:29:19,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4521 states. [2025-03-08 05:29:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4521 to 4389. [2025-03-08 05:29:20,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4389 states, 3282 states have (on average 1.6106032906764167) internal successors, (5286), 3404 states have internal predecessors, (5286), 889 states have call successors, (889), 187 states have call predecessors, (889), 217 states have return successors, (988), 863 states have call predecessors, (988), 884 states have call successors, (988) [2025-03-08 05:29:20,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4389 states to 4389 states and 7163 transitions. [2025-03-08 05:29:20,062 INFO L78 Accepts]: Start accepts. Automaton has 4389 states and 7163 transitions. Word has length 130 [2025-03-08 05:29:20,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:20,064 INFO L471 AbstractCegarLoop]: Abstraction has 4389 states and 7163 transitions. [2025-03-08 05:29:20,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-08 05:29:20,064 INFO L276 IsEmpty]: Start isEmpty. Operand 4389 states and 7163 transitions. [2025-03-08 05:29:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:29:20,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:20,068 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-03-08 05:29:20,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:29:20,068 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:20,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:20,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1311561182, now seen corresponding path program 1 times [2025-03-08 05:29:20,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:20,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726568969] [2025-03-08 05:29:20,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:20,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:20,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:29:20,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:29:20,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:20,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:29:20,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:20,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726568969] [2025-03-08 05:29:20,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726568969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:20,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149753134] [2025-03-08 05:29:20,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:20,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:20,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:20,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:20,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:29:20,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:29:20,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:29:20,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:20,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:20,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 1720 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:29:20,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:29:20,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:20,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149753134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:20,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:20,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:29:20,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165411393] [2025-03-08 05:29:20,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:20,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:20,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:20,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:20,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:20,506 INFO L87 Difference]: Start difference. First operand 4389 states and 7163 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-03-08 05:29:20,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:20,658 INFO L93 Difference]: Finished difference Result 11881 states and 19620 transitions. [2025-03-08 05:29:20,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:20,658 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-03-08 05:29:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:20,702 INFO L225 Difference]: With dead ends: 11881 [2025-03-08 05:29:20,702 INFO L226 Difference]: Without dead ends: 7537 [2025-03-08 05:29:20,727 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-03-08 05:29:20,728 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 887 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1821 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-03-08 05:29:20,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1821 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7537 states. [2025-03-08 05:29:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7537 to 7534. [2025-03-08 05:29:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7534 states, 5615 states have (on average 1.6069456812110419) internal successors, (9023), 5829 states have internal predecessors, (9023), 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-03-08 05:29:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7534 states to 7534 states and 12416 transitions. [2025-03-08 05:29:21,069 INFO L78 Accepts]: Start accepts. Automaton has 7534 states and 12416 transitions. Word has length 131 [2025-03-08 05:29:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:21,071 INFO L471 AbstractCegarLoop]: Abstraction has 7534 states and 12416 transitions. [2025-03-08 05:29:21,071 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-03-08 05:29:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 7534 states and 12416 transitions. [2025-03-08 05:29:21,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:29:21,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:21,076 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-03-08 05:29:21,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:29:21,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 05:29:21,276 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:21,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:21,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2003907989, now seen corresponding path program 1 times [2025-03-08 05:29:21,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:21,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337771950] [2025-03-08 05:29:21,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:21,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:21,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:29:21,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:29:21,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:21,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:29:21,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:21,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337771950] [2025-03-08 05:29:21,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337771950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:21,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51481209] [2025-03-08 05:29:21,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:21,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:21,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:21,387 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:21,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:29:21,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:29:21,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:29:21,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:21,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:21,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 1722 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:29:21,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:29:21,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:21,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51481209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:21,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:21,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:29:21,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645348216] [2025-03-08 05:29:21,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:21,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:21,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:21,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:21,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:21,669 INFO L87 Difference]: Start difference. First operand 7534 states and 12416 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-03-08 05:29:22,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:22,066 INFO L93 Difference]: Finished difference Result 21318 states and 35714 transitions. [2025-03-08 05:29:22,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:22,067 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-03-08 05:29:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:22,142 INFO L225 Difference]: With dead ends: 21318 [2025-03-08 05:29:22,142 INFO L226 Difference]: Without dead ends: 13829 [2025-03-08 05:29:22,170 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-03-08 05:29:22,171 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 886 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1815 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-03-08 05:29:22,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1815 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:22,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13829 states. [2025-03-08 05:29:22,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13829 to 13825. [2025-03-08 05:29:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13825 states, 10282 states have (on average 1.6034818128768722) internal successors, (16487), 10680 states have internal predecessors, (16487), 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-03-08 05:29:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 23122 transitions. [2025-03-08 05:29:22,877 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 23122 transitions. Word has length 132 [2025-03-08 05:29:22,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:22,878 INFO L471 AbstractCegarLoop]: Abstraction has 13825 states and 23122 transitions. [2025-03-08 05:29:22,878 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-03-08 05:29:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 23122 transitions. [2025-03-08 05:29:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:29:22,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:22,883 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-03-08 05:29:22,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:29:23,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:23,084 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:23,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:23,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1991826308, now seen corresponding path program 1 times [2025-03-08 05:29:23,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:23,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377219513] [2025-03-08 05:29:23,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:23,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:23,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:29:23,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:29:23,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:23,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:29:23,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:23,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377219513] [2025-03-08 05:29:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377219513] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:23,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976634827] [2025-03-08 05:29:23,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:23,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:23,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:23,188 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:23,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:29:23,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:29:23,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:29:23,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:23,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:23,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 1724 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:29:23,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:29:23,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:23,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976634827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:23,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:23,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:29:23,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103172861] [2025-03-08 05:29:23,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:23,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:23,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:23,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:23,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:23,465 INFO L87 Difference]: Start difference. First operand 13825 states and 23122 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-03-08 05:29:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:24,116 INFO L93 Difference]: Finished difference Result 40193 states and 68919 transitions. [2025-03-08 05:29:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:24,116 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-03-08 05:29:24,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:24,244 INFO L225 Difference]: With dead ends: 40193 [2025-03-08 05:29:24,245 INFO L226 Difference]: Without dead ends: 26413 [2025-03-08 05:29:24,292 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-03-08 05:29:24,294 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 885 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 1806 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-03-08 05:29:24,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 1806 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:24,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26413 states. [2025-03-08 05:29:25,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26413 to 26408. [2025-03-08 05:29:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26408 states, 19617 states have (on average 1.5999898047611765) internal successors, (31387), 20383 states have internal predecessors, (31387), 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-03-08 05:29:25,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26408 states to 26408 states and 45196 transitions. [2025-03-08 05:29:25,606 INFO L78 Accepts]: Start accepts. Automaton has 26408 states and 45196 transitions. Word has length 133 [2025-03-08 05:29:25,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:25,606 INFO L471 AbstractCegarLoop]: Abstraction has 26408 states and 45196 transitions. [2025-03-08 05:29:25,606 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-03-08 05:29:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 26408 states and 45196 transitions. [2025-03-08 05:29:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 05:29:25,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:25,611 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-03-08 05:29:25,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:29:25,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:25,813 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:25,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:25,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1617297979, now seen corresponding path program 1 times [2025-03-08 05:29:25,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:25,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517109312] [2025-03-08 05:29:25,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:25,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:25,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 05:29:25,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 05:29:25,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:25,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:29:25,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:25,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517109312] [2025-03-08 05:29:25,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517109312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:25,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552562298] [2025-03-08 05:29:25,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:25,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:25,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:25,960 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:25,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:29:26,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 05:29:26,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 05:29:26,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:26,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:26,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 1726 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:29:26,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:29:26,272 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:26,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552562298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:26,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:26,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:29:26,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364631825] [2025-03-08 05:29:26,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:26,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:26,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:26,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:26,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:26,274 INFO L87 Difference]: Start difference. First operand 26408 states and 45196 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-03-08 05:29:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:27,770 INFO L93 Difference]: Finished difference Result 77944 states and 138871 transitions. [2025-03-08 05:29:27,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:27,770 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-03-08 05:29:27,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:28,160 INFO L225 Difference]: With dead ends: 77944 [2025-03-08 05:29:28,160 INFO L226 Difference]: Without dead ends: 51573 [2025-03-08 05:29:28,310 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-03-08 05:29:28,311 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 884 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1820 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-03-08 05:29:28,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1820 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:28,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51573 states. [2025-03-08 05:29:30,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51573 to 51567. [2025-03-08 05:29:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51567 states, 38281 states have (on average 1.595935320393929) internal successors, (61094), 39783 states have internal predecessors, (61094), 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-03-08 05:29:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51567 states to 51567 states and 91632 transitions. [2025-03-08 05:29:31,119 INFO L78 Accepts]: Start accepts. Automaton has 51567 states and 91632 transitions. Word has length 134 [2025-03-08 05:29:31,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:31,120 INFO L471 AbstractCegarLoop]: Abstraction has 51567 states and 91632 transitions. [2025-03-08 05:29:31,120 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-03-08 05:29:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 51567 states and 91632 transitions. [2025-03-08 05:29:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 05:29:31,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:31,147 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-03-08 05:29:31,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 05:29:31,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:31,348 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:31,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:31,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1487957757, now seen corresponding path program 1 times [2025-03-08 05:29:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:31,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361141886] [2025-03-08 05:29:31,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:31,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 05:29:31,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 05:29:31,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:31,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:31,528 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-08 05:29:31,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:31,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361141886] [2025-03-08 05:29:31,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361141886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:31,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:31,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:31,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976579868] [2025-03-08 05:29:31,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:31,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:31,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:31,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:31,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:31,531 INFO L87 Difference]: Start difference. First operand 51567 states and 91632 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-03-08 05:29:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:34,074 INFO L93 Difference]: Finished difference Result 103617 states and 193871 transitions. [2025-03-08 05:29:34,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:29:34,078 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-03-08 05:29:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:34,449 INFO L225 Difference]: With dead ends: 103617 [2025-03-08 05:29:34,449 INFO L226 Difference]: Without dead ends: 52095 [2025-03-08 05:29:34,725 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-03-08 05:29:34,726 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 897 mSDsluCounter, 2422 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 3307 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-03-08 05:29:34,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 3307 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:29:34,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52095 states. [2025-03-08 05:29:37,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52095 to 52095. [2025-03-08 05:29:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52095 states, 38677 states have (on average 1.5898337513250769) internal successors, (61490), 40179 states have internal predecessors, (61490), 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-03-08 05:29:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52095 states to 52095 states and 92127 transitions. [2025-03-08 05:29:37,932 INFO L78 Accepts]: Start accepts. Automaton has 52095 states and 92127 transitions. Word has length 204 [2025-03-08 05:29:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:37,932 INFO L471 AbstractCegarLoop]: Abstraction has 52095 states and 92127 transitions. [2025-03-08 05:29:37,932 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-03-08 05:29:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 52095 states and 92127 transitions. [2025-03-08 05:29:37,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 05:29:37,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:37,950 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-03-08 05:29:37,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:29:37,950 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:37,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:37,951 INFO L85 PathProgramCache]: Analyzing trace with hash 597956244, now seen corresponding path program 1 times [2025-03-08 05:29:37,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:37,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761595903] [2025-03-08 05:29:37,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:37,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:37,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 05:29:37,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 05:29:37,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:37,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-08 05:29:38,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:38,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761595903] [2025-03-08 05:29:38,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761595903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:38,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:38,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:38,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750620758] [2025-03-08 05:29:38,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:38,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:38,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:38,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:38,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:38,070 INFO L87 Difference]: Start difference. First operand 52095 states and 92127 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-03-08 05:29:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:40,319 INFO L93 Difference]: Finished difference Result 104805 states and 194828 transitions. [2025-03-08 05:29:40,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:29:40,319 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-03-08 05:29:40,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:40,706 INFO L225 Difference]: With dead ends: 104805 [2025-03-08 05:29:40,707 INFO L226 Difference]: Without dead ends: 52755 [2025-03-08 05:29:41,006 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-03-08 05:29:41,007 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 896 mSDsluCounter, 2426 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 3313 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:41,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 3313 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:29:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52755 states. [2025-03-08 05:29:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52755 to 52755. [2025-03-08 05:29:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52755 states, 39205 states have (on average 1.5818900650427241) internal successors, (62018), 40707 states have internal predecessors, (62018), 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-03-08 05:29:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52755 states to 52755 states and 92754 transitions. [2025-03-08 05:29:44,137 INFO L78 Accepts]: Start accepts. Automaton has 52755 states and 92754 transitions. Word has length 205 [2025-03-08 05:29:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:44,138 INFO L471 AbstractCegarLoop]: Abstraction has 52755 states and 92754 transitions. [2025-03-08 05:29:44,138 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-03-08 05:29:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 52755 states and 92754 transitions. [2025-03-08 05:29:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 05:29:44,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:44,154 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-03-08 05:29:44,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:29:44,155 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:44,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:44,155 INFO L85 PathProgramCache]: Analyzing trace with hash 318594688, now seen corresponding path program 1 times [2025-03-08 05:29:44,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:44,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557112411] [2025-03-08 05:29:44,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:44,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:44,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 05:29:44,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 05:29:44,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:44,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-08 05:29:44,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:44,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557112411] [2025-03-08 05:29:44,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557112411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:44,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:44,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:44,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495157706] [2025-03-08 05:29:44,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:44,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:44,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:44,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:44,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:44,302 INFO L87 Difference]: Start difference. First operand 52755 states and 92754 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-03-08 05:29:46,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:46,613 INFO L93 Difference]: Finished difference Result 106257 states and 196049 transitions. [2025-03-08 05:29:46,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:29:46,614 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-03-08 05:29:46,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:46,988 INFO L225 Difference]: With dead ends: 106257 [2025-03-08 05:29:46,988 INFO L226 Difference]: Without dead ends: 53547 [2025-03-08 05:29:47,300 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-03-08 05:29:47,300 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 896 mSDsluCounter, 2426 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 3313 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:47,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 3313 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:29:47,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53547 states.