./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec14_product27.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_spec14_product27.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 6cc96375562d846fbf28439914184b0f5b3d70ee1197dff8e1988bf2754bc90e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:22:38,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:22:38,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:22:38,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:22:38,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:22:38,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:22:38,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:22:38,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:22:38,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:22:38,787 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:22:38,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:22:38,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:22:38,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:22:38,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:22:38,788 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:22:38,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:22:38,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:22:38,788 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:22:38,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:22:38,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:22:38,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:22:38,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:22:38,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:22:38,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:22:38,789 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:22:38,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:22:38,789 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:22:38,789 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:22:38,789 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:22:38,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:22:38,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:22:38,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:22:38,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:22:38,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:22:38,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:22:38,790 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:22:38,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:22:38,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:22:38,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:22:38,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:22:38,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:22:38,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:22:38,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:22:38,790 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 -> 6cc96375562d846fbf28439914184b0f5b3d70ee1197dff8e1988bf2754bc90e [2025-03-08 05:22:39,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:22:39,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:22:39,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:22:39,024 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:22:39,024 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:22:39,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec14_product27.cil.c [2025-03-08 05:22:40,145 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59c663cca/30df22e0508f41488258867c288e5af5/FLAGf3cba5995 [2025-03-08 05:22:40,446 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:22:40,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product27.cil.c [2025-03-08 05:22:40,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59c663cca/30df22e0508f41488258867c288e5af5/FLAGf3cba5995 [2025-03-08 05:22:40,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59c663cca/30df22e0508f41488258867c288e5af5 [2025-03-08 05:22:40,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:22:40,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:22:40,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:22:40,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:22:40,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:22:40,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:22:40" (1/1) ... [2025-03-08 05:22:40,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446b9455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:40, skipping insertion in model container [2025-03-08 05:22:40,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:22:40" (1/1) ... [2025-03-08 05:22:40,769 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:22:40,872 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_spec14_product27.cil.c[1546,1559] [2025-03-08 05:22:41,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:22:41,143 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:22:41,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-03-08 05:22:41,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [57] [2025-03-08 05:22:41,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1620] [2025-03-08 05:22:41,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1975] [2025-03-08 05:22:41,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2066] [2025-03-08 05:22:41,152 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2432] [2025-03-08 05:22:41,152 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2467] [2025-03-08 05:22:41,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [2481] [2025-03-08 05:22:41,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2517] [2025-03-08 05:22:41,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2635] [2025-03-08 05:22:41,158 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_spec14_product27.cil.c[1546,1559] [2025-03-08 05:22:41,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:22:41,252 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:22:41,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:41 WrapperNode [2025-03-08 05:22:41,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:22:41,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:22:41,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:22:41,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:22:41,258 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:22:41" (1/1) ... [2025-03-08 05:22:41,273 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:22:41" (1/1) ... [2025-03-08 05:22:41,315 INFO L138 Inliner]: procedures = 92, calls = 335, calls flagged for inlining = 28, calls inlined = 25, statements flattened = 1091 [2025-03-08 05:22:41,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:22:41,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:22:41,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:22:41,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:22:41,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:41" (1/1) ... [2025-03-08 05:22:41,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:41" (1/1) ... [2025-03-08 05:22:41,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:41" (1/1) ... [2025-03-08 05:22:41,370 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:22:41,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:41" (1/1) ... [2025-03-08 05:22:41,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:41" (1/1) ... [2025-03-08 05:22:41,396 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:41" (1/1) ... [2025-03-08 05:22:41,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:41" (1/1) ... [2025-03-08 05:22:41,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:41" (1/1) ... [2025-03-08 05:22:41,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:41" (1/1) ... [2025-03-08 05:22:41,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:22:41,409 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:22:41,409 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:22:41,409 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:22:41,410 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:41" (1/1) ... [2025-03-08 05:22:41,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:22:41,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:41,442 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:22:41,450 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:22:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:22:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-08 05:22:41,467 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-08 05:22:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:22:41,467 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:22:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:22:41,467 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:22:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-08 05:22:41,468 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-08 05:22:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:22:41,468 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:22:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-08 05:22:41,468 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-08 05:22:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:22:41,469 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:22:41,469 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:22:41,469 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:22:41,469 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:22:41,469 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:22:41,469 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:22:41,470 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:22:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:22:41,470 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:22:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:22:41,470 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:22:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-08 05:22:41,471 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-08 05:22:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:22:41,472 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:22:41,472 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-03-08 05:22:41,472 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-03-08 05:22:41,472 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:22:41,472 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:22:41,472 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:22:41,472 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:22:41,472 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:22:41,472 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:22:41,472 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:22:41,472 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:22:41,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:22:41,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:22:41,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:22:41,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:22:41,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:22:41,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:22:41,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:22:41,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:22:41,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:22:41,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:22:41,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:22:41,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:22:41,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:22:41,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:22:41,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:22:41,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:22:41,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:22:41,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:22:41,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:22:41,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:22:41,475 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:22:41,475 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:22:41,475 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:22:41,475 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:22:41,475 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:22:41,475 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:22:41,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:22:41,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:22:41,475 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:22:41,475 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:22:41,615 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:22:41,619 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:22:41,661 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2632: #res := ~retValue_acc~26; [2025-03-08 05:22:41,674 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2554: #res := ~retValue_acc~24; [2025-03-08 05:22:41,677 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L150: #res := ~retValue_acc~0; [2025-03-08 05:22:41,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: #res := ~retValue_acc~1; [2025-03-08 05:22:41,741 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: #res#1 := ~retValue_acc~11#1; [2025-03-08 05:22:41,741 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L366-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~3#1; [2025-03-08 05:22:41,750 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1608: #res := ~retValue_acc~15; [2025-03-08 05:22:41,989 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L889: #res#1 := ~retValue_acc~9#1; [2025-03-08 05:22:41,989 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L860-1: stopRequestedInDirection__wrappee__empty_#res#1 := stopRequestedInDirection__wrappee__empty_~retValue_acc~8#1; [2025-03-08 05:22:42,036 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024: #res := ~retValue_acc~13; [2025-03-08 05:22:42,046 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2593: #res := ~retValue_acc~25; [2025-03-08 05:22:42,092 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L415-1: isEmpty_#res#1 := isEmpty_~retValue_acc~5#1; [2025-03-08 05:22:42,134 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L495-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~6#1; [2025-03-08 05:22:42,134 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L508-1: isIdle_#res#1 := isIdle_~retValue_acc~7#1; [2025-03-08 05:22:42,221 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1010-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~12#1; [2025-03-08 05:22:42,222 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1617-1: isExecutiveFloor_#res#1 := isExecutiveFloor_~retValue_acc~16#1; [2025-03-08 05:22:42,222 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L332-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~2#1; [2025-03-08 05:22:42,277 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2982: #res := ~retValue_acc~28; [2025-03-08 05:22:42,326 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1972-1: main_#res#1 := main_~retValue_acc~18#1; [2025-03-08 05:22:42,326 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2464-1: valid_product_#res#1 := valid_product_~retValue_acc~23#1; [2025-03-08 05:22:42,334 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746: #res := ~retValue_acc~27; [2025-03-08 05:22:42,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3293: #res := ~retValue_acc~29; [2025-03-08 05:22:42,461 INFO L? ?]: Removed 452 outVars from TransFormulas that were not future-live. [2025-03-08 05:22:42,461 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:22:42,478 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:22:42,478 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:22:42,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:22:42 BoogieIcfgContainer [2025-03-08 05:22:42,479 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:22:42,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:22:42,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:22:42,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:22:42,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:22:40" (1/3) ... [2025-03-08 05:22:42,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f928ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:22:42, skipping insertion in model container [2025-03-08 05:22:42,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:41" (2/3) ... [2025-03-08 05:22:42,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f928ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:22:42, skipping insertion in model container [2025-03-08 05:22:42,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:22:42" (3/3) ... [2025-03-08 05:22:42,486 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product27.cil.c [2025-03-08 05:22:42,495 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:22:42,498 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec14_product27.cil.c that has 24 procedures, 539 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:22:42,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:22:42,566 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;@4204b9cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:22:42,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:22:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 539 states, 421 states have (on average 1.6793349168646081) internal successors, (707), 437 states have internal predecessors, (707), 93 states have call successors, (93), 23 states have call predecessors, (93), 23 states have return successors, (93), 91 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 05:22:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:22:42,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:42,599 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:22:42,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:42,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:42,608 INFO L85 PathProgramCache]: Analyzing trace with hash 54329871, now seen corresponding path program 1 times [2025-03-08 05:22:42,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:42,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625502579] [2025-03-08 05:22:42,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:42,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:42,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:22:42,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:22:42,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:42,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:43,040 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:22:43,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:43,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625502579] [2025-03-08 05:22:43,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625502579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:43,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:43,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:22:43,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124605435] [2025-03-08 05:22:43,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:43,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:22:43,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:43,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:22:43,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:22:43,067 INFO L87 Difference]: Start difference. First operand has 539 states, 421 states have (on average 1.6793349168646081) internal successors, (707), 437 states have internal predecessors, (707), 93 states have call successors, (93), 23 states have call predecessors, (93), 23 states have return successors, (93), 91 states have call predecessors, (93), 93 states have call successors, (93) Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:43,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:43,228 INFO L93 Difference]: Finished difference Result 1071 states and 1786 transitions. [2025-03-08 05:22:43,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:22:43,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2025-03-08 05:22:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:43,247 INFO L225 Difference]: With dead ends: 1071 [2025-03-08 05:22:43,248 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 05:22:43,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:22:43,260 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 6 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:43,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2625 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:43,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 05:22:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-03-08 05:22:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 417 states have (on average 1.671462829736211) internal successors, (697), 432 states have internal predecessors, (697), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 05:22:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 882 transitions. [2025-03-08 05:22:43,344 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 882 transitions. Word has length 101 [2025-03-08 05:22:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:43,345 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 882 transitions. [2025-03-08 05:22:43,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 882 transitions. [2025-03-08 05:22:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:22:43,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:43,353 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:22:43,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:22:43,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:43,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:43,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1507478458, now seen corresponding path program 1 times [2025-03-08 05:22:43,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:43,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944831091] [2025-03-08 05:22:43,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:43,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:43,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:22:43,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:22:43,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:43,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:22:43,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:43,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944831091] [2025-03-08 05:22:43,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944831091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:43,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:43,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:22:43,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701984038] [2025-03-08 05:22:43,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:43,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:22:43,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:43,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:22:43,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:22:43,542 INFO L87 Difference]: Start difference. First operand 534 states and 882 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:43,622 INFO L93 Difference]: Finished difference Result 1051 states and 1741 transitions. [2025-03-08 05:22:43,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:22:43,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2025-03-08 05:22:43,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:43,628 INFO L225 Difference]: With dead ends: 1051 [2025-03-08 05:22:43,628 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 05:22:43,631 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:22:43,632 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 4 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:43,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2597 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:43,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 05:22:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-03-08 05:22:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 417 states have (on average 1.669064748201439) internal successors, (696), 432 states have internal predecessors, (696), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 05:22:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 881 transitions. [2025-03-08 05:22:43,660 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 881 transitions. Word has length 102 [2025-03-08 05:22:43,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:43,660 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 881 transitions. [2025-03-08 05:22:43,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:43,661 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 881 transitions. [2025-03-08 05:22:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:22:43,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:43,665 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:22:43,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:22:43,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:43,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:43,668 INFO L85 PathProgramCache]: Analyzing trace with hash 200217228, now seen corresponding path program 1 times [2025-03-08 05:22:43,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:43,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856027925] [2025-03-08 05:22:43,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:43,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:43,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:22:43,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:22:43,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:43,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:43,803 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:22:43,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:43,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856027925] [2025-03-08 05:22:43,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856027925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:43,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:43,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:22:43,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649140690] [2025-03-08 05:22:43,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:43,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:22:43,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:43,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:22:43,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:22:43,807 INFO L87 Difference]: Start difference. First operand 534 states and 881 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:43,867 INFO L93 Difference]: Finished difference Result 1051 states and 1740 transitions. [2025-03-08 05:22:43,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:22:43,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2025-03-08 05:22:43,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:43,871 INFO L225 Difference]: With dead ends: 1051 [2025-03-08 05:22:43,871 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 05:22:43,873 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:22:43,874 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 3 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:43,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2597 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:43,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 05:22:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-03-08 05:22:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 417 states have (on average 1.6666666666666667) internal successors, (695), 432 states have internal predecessors, (695), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 05:22:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 880 transitions. [2025-03-08 05:22:43,901 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 880 transitions. Word has length 103 [2025-03-08 05:22:43,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:43,902 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 880 transitions. [2025-03-08 05:22:43,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 880 transitions. [2025-03-08 05:22:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:22:43,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:43,905 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:22:43,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:22:43,906 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:43,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:43,906 INFO L85 PathProgramCache]: Analyzing trace with hash 183322275, now seen corresponding path program 1 times [2025-03-08 05:22:43,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:43,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461844537] [2025-03-08 05:22:43,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:43,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:43,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:22:43,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:22:43,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:43,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:44,034 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:22:44,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:44,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461844537] [2025-03-08 05:22:44,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461844537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:44,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:44,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:22:44,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472674353] [2025-03-08 05:22:44,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:44,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:22:44,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:44,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:22:44,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:22:44,035 INFO L87 Difference]: Start difference. First operand 534 states and 880 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:44,090 INFO L93 Difference]: Finished difference Result 1051 states and 1739 transitions. [2025-03-08 05:22:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:22:44,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2025-03-08 05:22:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:44,095 INFO L225 Difference]: With dead ends: 1051 [2025-03-08 05:22:44,095 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 05:22:44,099 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:22:44,101 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 2 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2597 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:22:44,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2597 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:44,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 05:22:44,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-03-08 05:22:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 417 states have (on average 1.6642685851318946) internal successors, (694), 432 states have internal predecessors, (694), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 05:22:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 879 transitions. [2025-03-08 05:22:44,130 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 879 transitions. Word has length 104 [2025-03-08 05:22:44,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:44,131 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 879 transitions. [2025-03-08 05:22:44,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:44,132 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 879 transitions. [2025-03-08 05:22:44,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 05:22:44,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:44,135 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:22:44,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:22:44,136 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:44,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:44,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1756274935, now seen corresponding path program 1 times [2025-03-08 05:22:44,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:44,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257847034] [2025-03-08 05:22:44,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:44,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:44,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 05:22:44,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 05:22:44,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:44,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:22:44,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:44,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257847034] [2025-03-08 05:22:44,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257847034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:44,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:44,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:22:44,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902445082] [2025-03-08 05:22:44,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:44,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:22:44,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:44,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:22:44,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:22:44,261 INFO L87 Difference]: Start difference. First operand 534 states and 879 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:44,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:44,315 INFO L93 Difference]: Finished difference Result 1051 states and 1738 transitions. [2025-03-08 05:22:44,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:22:44,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2025-03-08 05:22:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:44,318 INFO L225 Difference]: With dead ends: 1051 [2025-03-08 05:22:44,318 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 05:22:44,321 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:22:44,322 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 1 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:44,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2597 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:44,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 05:22:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-03-08 05:22:44,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 417 states have (on average 1.6618705035971224) internal successors, (693), 432 states have internal predecessors, (693), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 05:22:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 878 transitions. [2025-03-08 05:22:44,348 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 878 transitions. Word has length 105 [2025-03-08 05:22:44,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:44,348 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 878 transitions. [2025-03-08 05:22:44,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 878 transitions. [2025-03-08 05:22:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 05:22:44,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:44,352 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:22:44,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:22:44,352 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:44,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:44,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1124867328, now seen corresponding path program 1 times [2025-03-08 05:22:44,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:44,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461944663] [2025-03-08 05:22:44,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:44,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:44,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 05:22:44,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:22:44,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:44,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:44,559 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:22:44,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:44,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461944663] [2025-03-08 05:22:44,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461944663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:44,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:44,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:22:44,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640467847] [2025-03-08 05:22:44,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:44,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:22:44,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:44,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:22:44,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:22:44,560 INFO L87 Difference]: Start difference. First operand 534 states and 878 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:22:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:44,657 INFO L93 Difference]: Finished difference Result 1062 states and 1755 transitions. [2025-03-08 05:22:44,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:22:44,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 106 [2025-03-08 05:22:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:44,661 INFO L225 Difference]: With dead ends: 1062 [2025-03-08 05:22:44,661 INFO L226 Difference]: Without dead ends: 549 [2025-03-08 05:22:44,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:22:44,663 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 91 mSDsluCounter, 5954 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6817 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:44,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6817 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:22:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-08 05:22:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 547. [2025-03-08 05:22:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 427 states have (on average 1.6580796252927401) internal successors, (708), 444 states have internal predecessors, (708), 94 states have call successors, (94), 24 states have call predecessors, (94), 25 states have return successors, (96), 91 states have call predecessors, (96), 93 states have call successors, (96) [2025-03-08 05:22:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 898 transitions. [2025-03-08 05:22:44,687 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 898 transitions. Word has length 106 [2025-03-08 05:22:44,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:44,688 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 898 transitions. [2025-03-08 05:22:44,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:22:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 898 transitions. [2025-03-08 05:22:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 05:22:44,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:44,692 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:22:44,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:22:44,693 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:44,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:44,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2063398943, now seen corresponding path program 1 times [2025-03-08 05:22:44,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:44,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504041123] [2025-03-08 05:22:44,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:44,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:44,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 05:22:44,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:22:44,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:44,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:22:44,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:44,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504041123] [2025-03-08 05:22:44,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504041123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:44,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:44,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:22:44,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502759913] [2025-03-08 05:22:44,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:44,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:22:44,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:44,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:22:44,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:22:44,804 INFO L87 Difference]: Start difference. First operand 547 states and 898 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:44,855 INFO L93 Difference]: Finished difference Result 1069 states and 1766 transitions. [2025-03-08 05:22:44,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:22:44,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2025-03-08 05:22:44,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:44,859 INFO L225 Difference]: With dead ends: 1069 [2025-03-08 05:22:44,859 INFO L226 Difference]: Without dead ends: 543 [2025-03-08 05:22:44,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:22:44,862 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 1 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:44,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2592 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-08 05:22:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2025-03-08 05:22:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 425 states have (on average 1.6588235294117648) internal successors, (705), 441 states have internal predecessors, (705), 93 states have call successors, (93), 24 states have call predecessors, (93), 24 states have return successors, (93), 90 states have call predecessors, (93), 92 states have call successors, (93) [2025-03-08 05:22:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 891 transitions. [2025-03-08 05:22:44,883 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 891 transitions. Word has length 106 [2025-03-08 05:22:44,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:44,883 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 891 transitions. [2025-03-08 05:22:44,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 891 transitions. [2025-03-08 05:22:44,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:22:44,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:44,885 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:22:44,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:22:44,886 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:44,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:44,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1949082668, now seen corresponding path program 1 times [2025-03-08 05:22:44,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:44,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654754956] [2025-03-08 05:22:44,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:44,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:44,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 05:22:44,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:22:44,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:44,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:22:45,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:45,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654754956] [2025-03-08 05:22:45,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654754956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:45,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:45,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:22:45,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823360874] [2025-03-08 05:22:45,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:45,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:22:45,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:45,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:22:45,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:22:45,013 INFO L87 Difference]: Start difference. First operand 543 states and 891 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:45,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:45,238 INFO L93 Difference]: Finished difference Result 1112 states and 1838 transitions. [2025-03-08 05:22:45,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:22:45,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2025-03-08 05:22:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:45,241 INFO L225 Difference]: With dead ends: 1112 [2025-03-08 05:22:45,242 INFO L226 Difference]: Without dead ends: 575 [2025-03-08 05:22:45,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:22:45,244 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 72 mSDsluCounter, 3281 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 4121 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:45,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 4121 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:22:45,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-08 05:22:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 548. [2025-03-08 05:22:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 430 states have (on average 1.6441860465116278) internal successors, (707), 445 states have internal predecessors, (707), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 05:22:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 892 transitions. [2025-03-08 05:22:45,265 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 892 transitions. Word has length 107 [2025-03-08 05:22:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:45,265 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 892 transitions. [2025-03-08 05:22:45,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 892 transitions. [2025-03-08 05:22:45,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:22:45,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:45,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:22:45,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:22:45,268 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:45,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash -744088233, now seen corresponding path program 1 times [2025-03-08 05:22:45,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:45,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573859876] [2025-03-08 05:22:45,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:45,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:45,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:22:45,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:22:45,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:45,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:22:45,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:45,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573859876] [2025-03-08 05:22:45,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573859876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:45,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:45,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:22:45,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314826914] [2025-03-08 05:22:45,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:45,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:22:45,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:45,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:22:45,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:22:45,378 INFO L87 Difference]: Start difference. First operand 548 states and 892 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:45,536 INFO L93 Difference]: Finished difference Result 1063 states and 1733 transitions. [2025-03-08 05:22:45,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:45,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-08 05:22:45,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:45,540 INFO L225 Difference]: With dead ends: 1063 [2025-03-08 05:22:45,540 INFO L226 Difference]: Without dead ends: 566 [2025-03-08 05:22:45,542 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:22:45,543 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 56 mSDsluCounter, 3269 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4098 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:45,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4098 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:22:45,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-08 05:22:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 548. [2025-03-08 05:22:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 430 states have (on average 1.6348837209302325) internal successors, (703), 445 states have internal predecessors, (703), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 05:22:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 888 transitions. [2025-03-08 05:22:45,570 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 888 transitions. Word has length 108 [2025-03-08 05:22:45,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:45,571 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 888 transitions. [2025-03-08 05:22:45,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:45,571 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 888 transitions. [2025-03-08 05:22:45,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:22:45,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:45,573 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:22:45,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:22:45,573 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:45,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:45,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1649891017, now seen corresponding path program 1 times [2025-03-08 05:22:45,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:45,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312396694] [2025-03-08 05:22:45,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:45,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:45,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:22:45,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:22:45,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:45,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:22:45,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:45,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312396694] [2025-03-08 05:22:45,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312396694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:45,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:45,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:22:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914860012] [2025-03-08 05:22:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:45,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:22:45,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:45,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:22:45,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:22:45,708 INFO L87 Difference]: Start difference. First operand 548 states and 888 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:45,858 INFO L93 Difference]: Finished difference Result 1063 states and 1729 transitions. [2025-03-08 05:22:45,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:45,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2025-03-08 05:22:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:45,862 INFO L225 Difference]: With dead ends: 1063 [2025-03-08 05:22:45,862 INFO L226 Difference]: Without dead ends: 566 [2025-03-08 05:22:45,865 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:22:45,866 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 55 mSDsluCounter, 3265 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4093 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:45,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4093 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:22:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-08 05:22:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 548. [2025-03-08 05:22:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 430 states have (on average 1.6255813953488372) internal successors, (699), 445 states have internal predecessors, (699), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 05:22:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 884 transitions. [2025-03-08 05:22:45,881 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 884 transitions. Word has length 109 [2025-03-08 05:22:45,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:45,882 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 884 transitions. [2025-03-08 05:22:45,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 884 transitions. [2025-03-08 05:22:45,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:22:45,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:45,884 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:22:45,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:22:45,884 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:45,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:45,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1471609510, now seen corresponding path program 1 times [2025-03-08 05:22:45,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:45,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370951797] [2025-03-08 05:22:45,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:45,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:45,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:22:45,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:22:45,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:45,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:22:45,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:45,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370951797] [2025-03-08 05:22:45,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370951797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:45,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:45,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:22:45,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416307096] [2025-03-08 05:22:45,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:45,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:22:45,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:45,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:22:45,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:22:45,996 INFO L87 Difference]: Start difference. First operand 548 states and 884 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:22:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:46,069 INFO L93 Difference]: Finished difference Result 1054 states and 1711 transitions. [2025-03-08 05:22:46,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:22:46,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 109 [2025-03-08 05:22:46,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:46,073 INFO L225 Difference]: With dead ends: 1054 [2025-03-08 05:22:46,073 INFO L226 Difference]: Without dead ends: 536 [2025-03-08 05:22:46,075 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:22:46,076 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 94 mSDsluCounter, 4174 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 5028 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:46,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 5028 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-08 05:22:46,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 527. [2025-03-08 05:22:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 409 states have (on average 1.6185819070904646) internal successors, (662), 424 states have internal predecessors, (662), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 05:22:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 847 transitions. [2025-03-08 05:22:46,091 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 847 transitions. Word has length 109 [2025-03-08 05:22:46,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:46,091 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 847 transitions. [2025-03-08 05:22:46,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:22:46,092 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 847 transitions. [2025-03-08 05:22:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:22:46,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:46,094 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:22:46,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:22:46,095 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:46,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:46,096 INFO L85 PathProgramCache]: Analyzing trace with hash 729069146, now seen corresponding path program 1 times [2025-03-08 05:22:46,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:46,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153478738] [2025-03-08 05:22:46,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:46,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:46,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:22:46,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:22:46,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:46,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:22:46,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:46,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153478738] [2025-03-08 05:22:46,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153478738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:46,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:46,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:22:46,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984682264] [2025-03-08 05:22:46,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:46,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:22:46,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:46,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:22:46,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:22:46,201 INFO L87 Difference]: Start difference. First operand 527 states and 847 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:46,284 INFO L93 Difference]: Finished difference Result 1033 states and 1674 transitions. [2025-03-08 05:22:46,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:46,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2025-03-08 05:22:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:46,288 INFO L225 Difference]: With dead ends: 1033 [2025-03-08 05:22:46,288 INFO L226 Difference]: Without dead ends: 536 [2025-03-08 05:22:46,290 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:22:46,291 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 39 mSDsluCounter, 3269 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 4098 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:46,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 4098 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:22:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-08 05:22:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 527. [2025-03-08 05:22:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 409 states have (on average 1.6161369193154034) internal successors, (661), 424 states have internal predecessors, (661), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 05:22:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 846 transitions. [2025-03-08 05:22:46,306 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 846 transitions. Word has length 110 [2025-03-08 05:22:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:46,306 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 846 transitions. [2025-03-08 05:22:46,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 846 transitions. [2025-03-08 05:22:46,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 05:22:46,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:46,309 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:22:46,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:22:46,309 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:46,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:46,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1856465562, now seen corresponding path program 1 times [2025-03-08 05:22:46,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:46,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450708986] [2025-03-08 05:22:46,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:46,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:46,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 05:22:46,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 05:22:46,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:46,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:22:46,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:46,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450708986] [2025-03-08 05:22:46,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450708986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:46,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:46,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:22:46,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363536502] [2025-03-08 05:22:46,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:46,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:22:46,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:46,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:22:46,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:22:46,414 INFO L87 Difference]: Start difference. First operand 527 states and 846 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:46,491 INFO L93 Difference]: Finished difference Result 1033 states and 1673 transitions. [2025-03-08 05:22:46,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:46,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-03-08 05:22:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:46,494 INFO L225 Difference]: With dead ends: 1033 [2025-03-08 05:22:46,494 INFO L226 Difference]: Without dead ends: 536 [2025-03-08 05:22:46,496 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:22:46,497 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 38 mSDsluCounter, 3269 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4098 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:46,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4098 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:46,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-08 05:22:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 527. [2025-03-08 05:22:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 409 states have (on average 1.6136919315403424) internal successors, (660), 424 states have internal predecessors, (660), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 05:22:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 845 transitions. [2025-03-08 05:22:46,512 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 845 transitions. Word has length 111 [2025-03-08 05:22:46,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:46,512 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 845 transitions. [2025-03-08 05:22:46,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:22:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 845 transitions. [2025-03-08 05:22:46,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:22:46,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:46,514 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:22:46,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:22:46,515 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:46,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:46,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1454875811, now seen corresponding path program 1 times [2025-03-08 05:22:46,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:46,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038532234] [2025-03-08 05:22:46,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:46,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:46,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:22:46,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:22:46,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:46,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:22:46,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:46,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038532234] [2025-03-08 05:22:46,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038532234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:46,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:46,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:22:46,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480365489] [2025-03-08 05:22:46,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:46,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:22:46,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:46,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:22:46,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:22:46,712 INFO L87 Difference]: Start difference. First operand 527 states and 845 transitions. Second operand has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:22:46,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:46,850 INFO L93 Difference]: Finished difference Result 1023 states and 1655 transitions. [2025-03-08 05:22:46,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:22:46,850 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 112 [2025-03-08 05:22:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:46,853 INFO L225 Difference]: With dead ends: 1023 [2025-03-08 05:22:46,853 INFO L226 Difference]: Without dead ends: 532 [2025-03-08 05:22:46,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:22:46,856 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 21 mSDsluCounter, 6377 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 7178 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:46,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 7178 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:22:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-08 05:22:46,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 529. [2025-03-08 05:22:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 411 states have (on average 1.608272506082725) internal successors, (661), 426 states have internal predecessors, (661), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 05:22:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 846 transitions. [2025-03-08 05:22:46,874 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 846 transitions. Word has length 112 [2025-03-08 05:22:46,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:46,875 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 846 transitions. [2025-03-08 05:22:46,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:22:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 846 transitions. [2025-03-08 05:22:46,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:22:46,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:46,878 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:22:46,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:22:46,878 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:46,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:46,878 INFO L85 PathProgramCache]: Analyzing trace with hash -707132371, now seen corresponding path program 1 times [2025-03-08 05:22:46,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:46,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262146665] [2025-03-08 05:22:46,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:46,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:46,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:22:46,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:22:46,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:46,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:22:46,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:46,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262146665] [2025-03-08 05:22:46,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262146665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:46,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334921753] [2025-03-08 05:22:46,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:46,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:46,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:46,996 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:22:46,998 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:22:47,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:22:47,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:22:47,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:47,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:47,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:22:47,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:22:47,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:47,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334921753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:47,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:47,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:22:47,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698532238] [2025-03-08 05:22:47,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:47,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:22:47,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:47,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:22:47,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:22:47,283 INFO L87 Difference]: Start difference. First operand 529 states and 846 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:22:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:47,349 INFO L93 Difference]: Finished difference Result 1496 states and 2459 transitions. [2025-03-08 05:22:47,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:22:47,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2025-03-08 05:22:47,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:47,355 INFO L225 Difference]: With dead ends: 1496 [2025-03-08 05:22:47,355 INFO L226 Difference]: Without dead ends: 1010 [2025-03-08 05:22:47,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 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:22:47,358 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 822 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:47,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1631 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-03-08 05:22:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1003. [2025-03-08 05:22:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 779 states have (on average 1.6290115532734275) internal successors, (1269), 807 states have internal predecessors, (1269), 178 states have call successors, (178), 46 states have call predecessors, (178), 45 states have return successors, (188), 175 states have call predecessors, (188), 176 states have call successors, (188) [2025-03-08 05:22:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1635 transitions. [2025-03-08 05:22:47,398 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1635 transitions. Word has length 113 [2025-03-08 05:22:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:47,400 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1635 transitions. [2025-03-08 05:22:47,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:22:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1635 transitions. [2025-03-08 05:22:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:22:47,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:47,403 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:22:47,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:22:47,603 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,SelfDestructingSolverStorable14 [2025-03-08 05:22:47,603 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:47,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash -738152178, now seen corresponding path program 1 times [2025-03-08 05:22:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:47,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240264222] [2025-03-08 05:22:47,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:47,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:47,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:22:47,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:22:47,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:47,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:22:47,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:47,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240264222] [2025-03-08 05:22:47,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240264222] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:47,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779142222] [2025-03-08 05:22:47,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:47,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:47,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:47,719 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:22:47,721 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:22:47,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:22:47,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:22:47,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:47,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:47,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:22:47,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:22:48,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:48,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779142222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:48,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:48,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:22:48,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695183677] [2025-03-08 05:22:48,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:48,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:22:48,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:48,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:22:48,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:22:48,066 INFO L87 Difference]: Start difference. First operand 1003 states and 1635 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:22:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:48,548 INFO L93 Difference]: Finished difference Result 1979 states and 3299 transitions. [2025-03-08 05:22:48,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:48,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2025-03-08 05:22:48,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:48,556 INFO L225 Difference]: With dead ends: 1979 [2025-03-08 05:22:48,556 INFO L226 Difference]: Without dead ends: 1019 [2025-03-08 05:22:48,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:22:48,564 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 787 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 2057 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:48,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 2057 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:22:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-03-08 05:22:48,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1019. [2025-03-08 05:22:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 793 states have (on average 1.630517023959647) internal successors, (1293), 821 states have internal predecessors, (1293), 178 states have call successors, (178), 48 states have call predecessors, (178), 47 states have return successors, (190), 175 states have call predecessors, (190), 176 states have call successors, (190) [2025-03-08 05:22:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1661 transitions. [2025-03-08 05:22:48,646 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1661 transitions. Word has length 113 [2025-03-08 05:22:48,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:48,647 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1661 transitions. [2025-03-08 05:22:48,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:22:48,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1661 transitions. [2025-03-08 05:22:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:22:48,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:48,649 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:22:48,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:22:48,854 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,SelfDestructingSolverStorable15 [2025-03-08 05:22:48,854 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:48,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:48,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1154544230, now seen corresponding path program 1 times [2025-03-08 05:22:48,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:48,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230116963] [2025-03-08 05:22:48,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:48,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:48,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:22:48,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:22:48,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:48,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:48,965 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:22:48,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:48,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230116963] [2025-03-08 05:22:48,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230116963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:48,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232696033] [2025-03-08 05:22:48,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:48,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:48,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:48,971 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:22:48,973 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:22:49,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:22:49,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:22:49,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:49,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:49,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:22:49,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:22:49,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:49,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232696033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:49,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:49,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:22:49,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731261076] [2025-03-08 05:22:49,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:49,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:22:49,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:49,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:22:49,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:22:49,274 INFO L87 Difference]: Start difference. First operand 1019 states and 1661 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:22:49,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:49,730 INFO L93 Difference]: Finished difference Result 2011 states and 3345 transitions. [2025-03-08 05:22:49,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:49,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-03-08 05:22:49,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:49,736 INFO L225 Difference]: With dead ends: 2011 [2025-03-08 05:22:49,736 INFO L226 Difference]: Without dead ends: 1035 [2025-03-08 05:22:49,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:22:49,743 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 778 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:49,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 2054 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:22:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2025-03-08 05:22:49,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1035. [2025-03-08 05:22:49,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 807 states have (on average 1.6319702602230484) internal successors, (1317), 835 states have internal predecessors, (1317), 178 states have call successors, (178), 50 states have call predecessors, (178), 49 states have return successors, (192), 175 states have call predecessors, (192), 176 states have call successors, (192) [2025-03-08 05:22:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1687 transitions. [2025-03-08 05:22:49,803 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1687 transitions. Word has length 116 [2025-03-08 05:22:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:49,803 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1687 transitions. [2025-03-08 05:22:49,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:22:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1687 transitions. [2025-03-08 05:22:49,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:22:49,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:49,806 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:22:49,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:22:50,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:50,007 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:50,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:50,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1180687093, now seen corresponding path program 1 times [2025-03-08 05:22:50,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:50,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374455468] [2025-03-08 05:22:50,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:50,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:50,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:22:50,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:22:50,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:50,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 05:22:50,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:50,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374455468] [2025-03-08 05:22:50,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374455468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:50,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562150354] [2025-03-08 05:22:50,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:50,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:50,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:50,101 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:22:50,103 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:22:50,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:22:50,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:22:50,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:50,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:50,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 1222 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:22:50,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 05:22:50,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:50,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562150354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:50,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:50,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:22:50,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55253618] [2025-03-08 05:22:50,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:50,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:22:50,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:50,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:22:50,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:22:50,410 INFO L87 Difference]: Start difference. First operand 1035 states and 1687 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:22:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:50,838 INFO L93 Difference]: Finished difference Result 2043 states and 3391 transitions. [2025-03-08 05:22:50,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:50,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-03-08 05:22:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:50,846 INFO L225 Difference]: With dead ends: 2043 [2025-03-08 05:22:50,846 INFO L226 Difference]: Without dead ends: 1051 [2025-03-08 05:22:50,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:22:50,851 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 779 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:50,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 2051 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:22:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-08 05:22:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2025-03-08 05:22:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 821 states have (on average 1.633373934226553) internal successors, (1341), 849 states have internal predecessors, (1341), 178 states have call successors, (178), 52 states have call predecessors, (178), 51 states have return successors, (194), 175 states have call predecessors, (194), 176 states have call successors, (194) [2025-03-08 05:22:50,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1713 transitions. [2025-03-08 05:22:50,903 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1713 transitions. Word has length 119 [2025-03-08 05:22:50,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:50,905 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1713 transitions. [2025-03-08 05:22:50,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:22:50,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1713 transitions. [2025-03-08 05:22:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 05:22:50,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:50,908 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:22:50,916 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:22:51,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 05:22:51,108 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:51,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:51,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1975538031, now seen corresponding path program 1 times [2025-03-08 05:22:51,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:51,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36167115] [2025-03-08 05:22:51,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:51,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:51,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 05:22:51,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 05:22:51,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:51,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:22:51,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:51,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36167115] [2025-03-08 05:22:51,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36167115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:51,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020522978] [2025-03-08 05:22:51,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:51,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:51,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:51,208 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:22:51,210 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:22:51,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 05:22:51,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 05:22:51,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:51,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:51,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:22:51,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:22:51,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:51,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020522978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:51,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:51,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:22:51,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020952676] [2025-03-08 05:22:51,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:51,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:22:51,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:51,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:22:51,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:22:51,512 INFO L87 Difference]: Start difference. First operand 1051 states and 1713 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:22:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:51,916 INFO L93 Difference]: Finished difference Result 2075 states and 3437 transitions. [2025-03-08 05:22:51,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:51,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-03-08 05:22:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:51,923 INFO L225 Difference]: With dead ends: 2075 [2025-03-08 05:22:51,923 INFO L226 Difference]: Without dead ends: 1067 [2025-03-08 05:22:51,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:22:51,928 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 773 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:51,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 2048 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:22:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2025-03-08 05:22:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1067. [2025-03-08 05:22:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 835 states have (on average 1.6347305389221556) internal successors, (1365), 863 states have internal predecessors, (1365), 178 states have call successors, (178), 54 states have call predecessors, (178), 53 states have return successors, (196), 175 states have call predecessors, (196), 176 states have call successors, (196) [2025-03-08 05:22:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1739 transitions. [2025-03-08 05:22:51,977 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1739 transitions. Word has length 122 [2025-03-08 05:22:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:51,978 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1739 transitions. [2025-03-08 05:22:51,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:22:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1739 transitions. [2025-03-08 05:22:51,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 05:22:51,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:51,980 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:22:51,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:22:52,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:52,180 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:52,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:52,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1788113022, now seen corresponding path program 1 times [2025-03-08 05:22:52,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:52,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572519927] [2025-03-08 05:22:52,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:52,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:52,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:22:52,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:22:52,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:52,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:22:52,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:52,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572519927] [2025-03-08 05:22:52,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572519927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:52,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643627899] [2025-03-08 05:22:52,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:52,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:52,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:52,272 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:22:52,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:22:52,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:22:52,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:22:52,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:52,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:52,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:22:52,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:22:52,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:52,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643627899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:52,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:52,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 05:22:52,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322615999] [2025-03-08 05:22:52,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:52,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:22:52,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:52,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:22:52,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:22:52,608 INFO L87 Difference]: Start difference. First operand 1067 states and 1739 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:22:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:53,013 INFO L93 Difference]: Finished difference Result 2095 states and 3491 transitions. [2025-03-08 05:22:53,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:53,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-03-08 05:22:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:53,020 INFO L225 Difference]: With dead ends: 2095 [2025-03-08 05:22:53,020 INFO L226 Difference]: Without dead ends: 1071 [2025-03-08 05:22:53,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 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:22:53,027 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 753 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:53,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 2048 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:22:53,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-03-08 05:22:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2025-03-08 05:22:53,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 837 states have (on average 1.6236559139784945) internal successors, (1359), 867 states have internal predecessors, (1359), 178 states have call successors, (178), 54 states have call predecessors, (178), 55 states have return successors, (198), 175 states have call predecessors, (198), 176 states have call successors, (198) [2025-03-08 05:22:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1735 transitions. [2025-03-08 05:22:53,064 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1735 transitions. Word has length 125 [2025-03-08 05:22:53,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:53,064 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1735 transitions. [2025-03-08 05:22:53,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:22:53,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1735 transitions. [2025-03-08 05:22:53,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 05:22:53,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:53,067 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:22:53,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 05:22:53,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:53,267 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:53,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:53,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1882953352, now seen corresponding path program 1 times [2025-03-08 05:22:53,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:53,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033868727] [2025-03-08 05:22:53,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:53,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:53,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:22:53,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:22:53,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:53,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:22:53,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:53,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033868727] [2025-03-08 05:22:53,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033868727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:53,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160078274] [2025-03-08 05:22:53,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:53,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:53,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:53,440 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:22:53,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:22:53,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:22:53,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:22:53,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:53,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:53,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 05:22:53,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 05:22:53,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:53,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160078274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:53,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:53,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2025-03-08 05:22:53,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790732305] [2025-03-08 05:22:53,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:53,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:22:53,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:53,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:22:53,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:22:53,784 INFO L87 Difference]: Start difference. First operand 1071 states and 1735 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:22:54,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:54,248 INFO L93 Difference]: Finished difference Result 2109 states and 3445 transitions. [2025-03-08 05:22:54,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:54,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 125 [2025-03-08 05:22:54,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:54,255 INFO L225 Difference]: With dead ends: 2109 [2025-03-08 05:22:54,255 INFO L226 Difference]: Without dead ends: 1081 [2025-03-08 05:22:54,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:22:54,259 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 739 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 3585 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:54,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 3585 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:22:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-03-08 05:22:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1074. [2025-03-08 05:22:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 839 states have (on average 1.6221692491060786) internal successors, (1361), 870 states have internal predecessors, (1361), 178 states have call successors, (178), 54 states have call predecessors, (178), 56 states have return successors, (199), 175 states have call predecessors, (199), 176 states have call successors, (199) [2025-03-08 05:22:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1738 transitions. [2025-03-08 05:22:54,310 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1738 transitions. Word has length 125 [2025-03-08 05:22:54,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:54,310 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1738 transitions. [2025-03-08 05:22:54,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:22:54,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1738 transitions. [2025-03-08 05:22:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:22:54,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:54,313 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:54,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 05:22:54,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:54,515 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:54,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:54,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1080294978, now seen corresponding path program 1 times [2025-03-08 05:22:54,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:54,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435414072] [2025-03-08 05:22:54,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:54,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:54,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:22:54,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:22:54,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:54,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:22:54,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:54,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435414072] [2025-03-08 05:22:54,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435414072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:54,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392415878] [2025-03-08 05:22:54,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:54,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:54,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:54,691 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:22:54,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 05:22:54,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:22:54,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:22:54,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:54,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:54,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 1224 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 05:22:54,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:22:55,019 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:55,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392415878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:55,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:55,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-08 05:22:55,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837101579] [2025-03-08 05:22:55,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:55,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:22:55,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:55,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:22:55,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:22:55,020 INFO L87 Difference]: Start difference. First operand 1074 states and 1738 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:22:55,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:55,369 INFO L93 Difference]: Finished difference Result 2123 states and 3483 transitions. [2025-03-08 05:22:55,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:22:55,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-03-08 05:22:55,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:55,377 INFO L225 Difference]: With dead ends: 2123 [2025-03-08 05:22:55,377 INFO L226 Difference]: Without dead ends: 1092 [2025-03-08 05:22:55,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:22:55,381 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 756 mSDsluCounter, 2385 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 3287 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:55,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 3287 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:22:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-03-08 05:22:55,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1084. [2025-03-08 05:22:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 845 states have (on average 1.6177514792899408) internal successors, (1367), 879 states have internal predecessors, (1367), 180 states have call successors, (180), 55 states have call predecessors, (180), 58 states have return successors, (209), 175 states have call predecessors, (209), 178 states have call successors, (209) [2025-03-08 05:22:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1756 transitions. [2025-03-08 05:22:55,417 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1756 transitions. Word has length 127 [2025-03-08 05:22:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:55,417 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1756 transitions. [2025-03-08 05:22:55,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:22:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1756 transitions. [2025-03-08 05:22:55,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:22:55,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:55,420 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:55,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 05:22:55,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 05:22:55,625 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:55,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:55,626 INFO L85 PathProgramCache]: Analyzing trace with hash -380812356, now seen corresponding path program 1 times [2025-03-08 05:22:55,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:55,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393483418] [2025-03-08 05:22:55,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:55,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:55,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:22:55,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:22:55,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:55,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:22:55,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:55,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393483418] [2025-03-08 05:22:55,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393483418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:55,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370104858] [2025-03-08 05:22:55,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:55,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:55,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:55,807 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:22:55,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 05:22:55,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:22:56,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:22:56,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:56,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:56,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:22:56,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:22:56,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:56,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370104858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:56,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:56,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 05:22:56,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811563873] [2025-03-08 05:22:56,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:56,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:22:56,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:56,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:22:56,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:22:56,038 INFO L87 Difference]: Start difference. First operand 1084 states and 1756 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:22:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:56,119 INFO L93 Difference]: Finished difference Result 2636 states and 4339 transitions. [2025-03-08 05:22:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:22:56,120 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-03-08 05:22:56,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:56,127 INFO L225 Difference]: With dead ends: 2636 [2025-03-08 05:22:56,128 INFO L226 Difference]: Without dead ends: 1596 [2025-03-08 05:22:56,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:22:56,131 INFO L435 NwaCegarLoop]: 1588 mSDtfsCounter, 784 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 2407 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:22:56,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 2407 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:56,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2025-03-08 05:22:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1084. [2025-03-08 05:22:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 845 states have (on average 1.616568047337278) internal successors, (1366), 879 states have internal predecessors, (1366), 180 states have call successors, (180), 55 states have call predecessors, (180), 58 states have return successors, (209), 175 states have call predecessors, (209), 178 states have call successors, (209) [2025-03-08 05:22:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1755 transitions. [2025-03-08 05:22:56,172 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1755 transitions. Word has length 132 [2025-03-08 05:22:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:56,173 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1755 transitions. [2025-03-08 05:22:56,173 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:22:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1755 transitions. [2025-03-08 05:22:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:22:56,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:56,176 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:56,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 05:22:56,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:56,377 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:56,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:56,377 INFO L85 PathProgramCache]: Analyzing trace with hash -30012419, now seen corresponding path program 1 times [2025-03-08 05:22:56,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:56,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925282880] [2025-03-08 05:22:56,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:56,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:56,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:22:56,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:22:56,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:56,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:22:56,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:56,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925282880] [2025-03-08 05:22:56,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925282880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:56,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210614118] [2025-03-08 05:22:56,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:56,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:56,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:56,529 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:22:56,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 05:22:56,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:22:56,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:22:56,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:56,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:56,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 05:22:56,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:22:56,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:56,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210614118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:56,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:56,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-08 05:22:56,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28254877] [2025-03-08 05:22:56,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:56,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:22:56,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:56,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:22:56,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:22:56,811 INFO L87 Difference]: Start difference. First operand 1084 states and 1755 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:22:56,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:56,898 INFO L93 Difference]: Finished difference Result 2698 states and 4390 transitions. [2025-03-08 05:22:56,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:22:56,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-03-08 05:22:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:56,908 INFO L225 Difference]: With dead ends: 2698 [2025-03-08 05:22:56,908 INFO L226 Difference]: Without dead ends: 1659 [2025-03-08 05:22:56,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:22:56,913 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 343 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 3525 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:56,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 3525 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2025-03-08 05:22:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1659. [2025-03-08 05:22:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1297 states have (on average 1.5890516576715497) internal successors, (2061), 1338 states have internal predecessors, (2061), 264 states have call successors, (264), 91 states have call predecessors, (264), 97 states have return successors, (347), 255 states have call predecessors, (347), 260 states have call successors, (347) [2025-03-08 05:22:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2672 transitions. [2025-03-08 05:22:56,991 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2672 transitions. Word has length 132 [2025-03-08 05:22:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:56,991 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2672 transitions. [2025-03-08 05:22:56,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:22:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2672 transitions. [2025-03-08 05:22:56,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:22:56,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:56,995 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:57,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 05:22:57,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-08 05:22:57,196 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:57,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:57,196 INFO L85 PathProgramCache]: Analyzing trace with hash -638089282, now seen corresponding path program 1 times [2025-03-08 05:22:57,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:57,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911412289] [2025-03-08 05:22:57,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:57,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:57,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:22:57,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:22:57,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:57,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:22:57,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:57,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911412289] [2025-03-08 05:22:57,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911412289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:57,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501629572] [2025-03-08 05:22:57,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:57,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:57,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:57,352 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:22:57,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 05:22:57,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:22:57,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:22:57,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:57,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:57,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:22:57,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:22:57,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:57,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501629572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:57,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:57,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2025-03-08 05:22:57,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846372149] [2025-03-08 05:22:57,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:57,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:22:57,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:57,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:22:57,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:22:57,641 INFO L87 Difference]: Start difference. First operand 1659 states and 2672 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:22:57,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:57,693 INFO L93 Difference]: Finished difference Result 3023 states and 4859 transitions. [2025-03-08 05:22:57,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:22:57,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-03-08 05:22:57,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:57,700 INFO L225 Difference]: With dead ends: 3023 [2025-03-08 05:22:57,700 INFO L226 Difference]: Without dead ends: 1409 [2025-03-08 05:22:57,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:22:57,705 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 547 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:57,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1319 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:57,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2025-03-08 05:22:57,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1409. [2025-03-08 05:22:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1099 states have (on average 1.5686988171064604) internal successors, (1724), 1131 states have internal predecessors, (1724), 223 states have call successors, (223), 83 states have call predecessors, (223), 86 states have return successors, (283), 218 states have call predecessors, (283), 219 states have call successors, (283) [2025-03-08 05:22:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 2230 transitions. [2025-03-08 05:22:57,747 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 2230 transitions. Word has length 132 [2025-03-08 05:22:57,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:57,747 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 2230 transitions. [2025-03-08 05:22:57,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:22:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 2230 transitions. [2025-03-08 05:22:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 05:22:57,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:57,750 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:22:57,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 05:22:57,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-08 05:22:57,950 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:57,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash 593949578, now seen corresponding path program 1 times [2025-03-08 05:22:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616542165] [2025-03-08 05:22:57,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:57,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 05:22:57,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 05:22:57,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:57,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-08 05:22:58,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:58,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616542165] [2025-03-08 05:22:58,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616542165] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:58,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615048153] [2025-03-08 05:22:58,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:58,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:58,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:58,112 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:22:58,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 05:22:58,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 05:22:58,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 05:22:58,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:58,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:58,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:22:58,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:58,350 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:22:58,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:58,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615048153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:58,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:58,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-08 05:22:58,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424666262] [2025-03-08 05:22:58,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:58,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:22:58,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:58,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:22:58,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:22:58,351 INFO L87 Difference]: Start difference. First operand 1409 states and 2230 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:22:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:58,517 INFO L93 Difference]: Finished difference Result 2863 states and 4592 transitions. [2025-03-08 05:22:58,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:22:58,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 155 [2025-03-08 05:22:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:58,524 INFO L225 Difference]: With dead ends: 2863 [2025-03-08 05:22:58,525 INFO L226 Difference]: Without dead ends: 1499 [2025-03-08 05:22:58,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:22:58,529 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 144 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:58,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2272 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:22:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2025-03-08 05:22:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1487. [2025-03-08 05:22:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 1175 states have (on average 1.5914893617021277) internal successors, (1870), 1207 states have internal predecessors, (1870), 223 states have call successors, (223), 85 states have call predecessors, (223), 88 states have return successors, (283), 218 states have call predecessors, (283), 219 states have call successors, (283) [2025-03-08 05:22:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2376 transitions. [2025-03-08 05:22:58,574 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2376 transitions. Word has length 155 [2025-03-08 05:22:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:58,574 INFO L471 AbstractCegarLoop]: Abstraction has 1487 states and 2376 transitions. [2025-03-08 05:22:58,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:22:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2376 transitions. [2025-03-08 05:22:58,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 05:22:58,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:58,578 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:22:58,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 05:22:58,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 05:22:58,778 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:58,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:58,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1027334601, now seen corresponding path program 1 times [2025-03-08 05:22:58,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:58,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667730467] [2025-03-08 05:22:58,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:58,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:58,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 05:22:58,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 05:22:58,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:58,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-08 05:22:58,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:58,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667730467] [2025-03-08 05:22:58,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667730467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:58,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366809390] [2025-03-08 05:22:58,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:58,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:58,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:58,933 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:22:58,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 05:22:59,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 05:22:59,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 05:22:59,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:59,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:59,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:22:59,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 05:22:59,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:59,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366809390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:59,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:59,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-08 05:22:59,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757202059] [2025-03-08 05:22:59,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:59,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:22:59,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:59,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:22:59,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:22:59,166 INFO L87 Difference]: Start difference. First operand 1487 states and 2376 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:22:59,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:59,325 INFO L93 Difference]: Finished difference Result 3025 states and 4886 transitions. [2025-03-08 05:22:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:22:59,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 160 [2025-03-08 05:22:59,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:59,337 INFO L225 Difference]: With dead ends: 3025 [2025-03-08 05:22:59,339 INFO L226 Difference]: Without dead ends: 1583 [2025-03-08 05:22:59,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:22:59,344 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 142 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:59,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 2269 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:22:59,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-08 05:22:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1565. [2025-03-08 05:22:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1251 states have (on average 1.6115107913669064) internal successors, (2016), 1283 states have internal predecessors, (2016), 223 states have call successors, (223), 87 states have call predecessors, (223), 90 states have return successors, (283), 218 states have call predecessors, (283), 219 states have call successors, (283) [2025-03-08 05:22:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2522 transitions. [2025-03-08 05:22:59,393 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2522 transitions. Word has length 160 [2025-03-08 05:22:59,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:59,393 INFO L471 AbstractCegarLoop]: Abstraction has 1565 states and 2522 transitions. [2025-03-08 05:22:59,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:22:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2522 transitions. [2025-03-08 05:22:59,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 05:22:59,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:59,396 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:22:59,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 05:22:59,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 05:22:59,597 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:59,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:59,597 INFO L85 PathProgramCache]: Analyzing trace with hash 21306153, now seen corresponding path program 1 times [2025-03-08 05:22:59,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:59,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607867198] [2025-03-08 05:22:59,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:59,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:59,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 05:22:59,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 05:22:59,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:59,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-08 05:22:59,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:59,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607867198] [2025-03-08 05:22:59,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607867198] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:59,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130274832] [2025-03-08 05:22:59,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:59,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:59,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:59,759 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:22:59,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 05:22:59,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 05:22:59,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 05:22:59,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:59,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:59,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 1341 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:22:59,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:23:00,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:00,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130274832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:00,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:00,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-08 05:23:00,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792276189] [2025-03-08 05:23:00,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:00,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:23:00,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:00,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:23:00,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:23:00,030 INFO L87 Difference]: Start difference. First operand 1565 states and 2522 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:23:00,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:00,191 INFO L93 Difference]: Finished difference Result 3187 states and 5180 transitions. [2025-03-08 05:23:00,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:23:00,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 164 [2025-03-08 05:23:00,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:00,200 INFO L225 Difference]: With dead ends: 3187 [2025-03-08 05:23:00,200 INFO L226 Difference]: Without dead ends: 1667 [2025-03-08 05:23:00,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:23:00,205 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 140 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:23:00,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 2266 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:23:00,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2025-03-08 05:23:00,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1643. [2025-03-08 05:23:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1327 states have (on average 1.629238884702336) internal successors, (2162), 1359 states have internal predecessors, (2162), 223 states have call successors, (223), 89 states have call predecessors, (223), 92 states have return successors, (283), 218 states have call predecessors, (283), 219 states have call successors, (283) [2025-03-08 05:23:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2668 transitions. [2025-03-08 05:23:00,274 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2668 transitions. Word has length 164 [2025-03-08 05:23:00,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:00,274 INFO L471 AbstractCegarLoop]: Abstraction has 1643 states and 2668 transitions. [2025-03-08 05:23:00,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:23:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2668 transitions. [2025-03-08 05:23:00,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 05:23:00,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:00,278 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:23:00,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 05:23:00,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:00,478 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:00,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:00,479 INFO L85 PathProgramCache]: Analyzing trace with hash -451479640, now seen corresponding path program 1 times [2025-03-08 05:23:00,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:00,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972763557] [2025-03-08 05:23:00,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:00,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:00,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:23:00,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:23:00,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:00,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 05:23:00,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:00,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972763557] [2025-03-08 05:23:00,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972763557] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:00,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791903327] [2025-03-08 05:23:00,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:00,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:00,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:00,625 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:23:00,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 05:23:00,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:23:00,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:23:00,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:00,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:00,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:23:00,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:23:00,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:00,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791903327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:00,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:00,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-08 05:23:00,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835003645] [2025-03-08 05:23:00,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:00,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:23:00,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:00,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:23:00,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:23:00,868 INFO L87 Difference]: Start difference. First operand 1643 states and 2668 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:23:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:01,021 INFO L93 Difference]: Finished difference Result 3349 states and 5474 transitions. [2025-03-08 05:23:01,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:23:01,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 167 [2025-03-08 05:23:01,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:01,028 INFO L225 Difference]: With dead ends: 3349 [2025-03-08 05:23:01,028 INFO L226 Difference]: Without dead ends: 1751 [2025-03-08 05:23:01,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:23:01,032 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 138 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:23:01,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 2263 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:23:01,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2025-03-08 05:23:01,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1721. [2025-03-08 05:23:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1403 states have (on average 1.6450463292943691) internal successors, (2308), 1435 states have internal predecessors, (2308), 223 states have call successors, (223), 91 states have call predecessors, (223), 94 states have return successors, (283), 218 states have call predecessors, (283), 219 states have call successors, (283) [2025-03-08 05:23:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2814 transitions. [2025-03-08 05:23:01,073 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2814 transitions. Word has length 167 [2025-03-08 05:23:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:01,073 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2814 transitions. [2025-03-08 05:23:01,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:23:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2814 transitions. [2025-03-08 05:23:01,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 05:23:01,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:01,076 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:23:01,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-08 05:23:01,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 05:23:01,277 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:01,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash 72835314, now seen corresponding path program 1 times [2025-03-08 05:23:01,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:01,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792793210] [2025-03-08 05:23:01,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:01,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:01,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 05:23:01,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 05:23:01,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:01,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-08 05:23:01,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:01,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792793210] [2025-03-08 05:23:01,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792793210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:01,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525124037] [2025-03-08 05:23:01,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:01,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:01,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:01,442 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:23:01,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 05:23:01,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 05:23:01,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 05:23:01,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:01,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:01,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 1346 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:23:01,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-08 05:23:01,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:01,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525124037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:01,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:01,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-08 05:23:01,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753021876] [2025-03-08 05:23:01,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:01,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:23:01,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:01,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:23:01,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:23:01,699 INFO L87 Difference]: Start difference. First operand 1721 states and 2814 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:23:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:01,846 INFO L93 Difference]: Finished difference Result 3511 states and 5768 transitions. [2025-03-08 05:23:01,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:23:01,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 169 [2025-03-08 05:23:01,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:01,855 INFO L225 Difference]: With dead ends: 3511 [2025-03-08 05:23:01,855 INFO L226 Difference]: Without dead ends: 1835 [2025-03-08 05:23:01,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:23:01,860 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 136 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:23:01,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 2256 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:23:01,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2025-03-08 05:23:01,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1799. [2025-03-08 05:23:01,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1479 states have (on average 1.6592292089249492) internal successors, (2454), 1511 states have internal predecessors, (2454), 223 states have call successors, (223), 93 states have call predecessors, (223), 96 states have return successors, (283), 218 states have call predecessors, (283), 219 states have call successors, (283) [2025-03-08 05:23:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2960 transitions. [2025-03-08 05:23:01,923 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2960 transitions. Word has length 169 [2025-03-08 05:23:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:01,924 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2960 transitions. [2025-03-08 05:23:01,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:23:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2960 transitions. [2025-03-08 05:23:01,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 05:23:01,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:01,928 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:23:01,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-08 05:23:02,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:02,129 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:02,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:02,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2091541270, now seen corresponding path program 1 times [2025-03-08 05:23:02,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:02,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790580092] [2025-03-08 05:23:02,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:02,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:02,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 05:23:02,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 05:23:02,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:02,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 05:23:02,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:02,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790580092] [2025-03-08 05:23:02,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790580092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:02,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453299600] [2025-03-08 05:23:02,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:02,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:02,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:02,285 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:23:02,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 05:23:02,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 05:23:02,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 05:23:02,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:02,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:02,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 1343 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 05:23:02,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-08 05:23:02,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:02,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453299600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:02,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:02,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-03-08 05:23:02,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759230959] [2025-03-08 05:23:02,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:02,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:23:02,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:02,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:23:02,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:23:02,646 INFO L87 Difference]: Start difference. First operand 1799 states and 2960 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:23:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:04,541 INFO L93 Difference]: Finished difference Result 5592 states and 9351 transitions. [2025-03-08 05:23:04,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:23:04,541 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) Word has length 169 [2025-03-08 05:23:04,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:04,559 INFO L225 Difference]: With dead ends: 5592 [2025-03-08 05:23:04,559 INFO L226 Difference]: Without dead ends: 3470 [2025-03-08 05:23:04,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:23:04,568 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 1855 mSDsluCounter, 1958 mSDsCounter, 0 mSdLazyCounter, 3866 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1958 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 4302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 3866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:23:04,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1958 Valid, 2351 Invalid, 4302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 3866 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 05:23:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2025-03-08 05:23:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3454. [2025-03-08 05:23:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 2797 states have (on average 1.6642831605291384) internal successors, (4655), 2885 states have internal predecessors, (4655), 463 states have call successors, (463), 167 states have call predecessors, (463), 193 states have return successors, (613), 459 states have call predecessors, (613), 459 states have call successors, (613) [2025-03-08 05:23:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 5731 transitions. [2025-03-08 05:23:04,662 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 5731 transitions. Word has length 169 [2025-03-08 05:23:04,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:04,663 INFO L471 AbstractCegarLoop]: Abstraction has 3454 states and 5731 transitions. [2025-03-08 05:23:04,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:23:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 5731 transitions. [2025-03-08 05:23:04,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-08 05:23:04,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:04,696 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:23:04,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-08 05:23:04,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:04,897 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:04,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:04,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2046878668, now seen corresponding path program 1 times [2025-03-08 05:23:04,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:04,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744958685] [2025-03-08 05:23:04,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:04,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:04,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 05:23:04,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 05:23:04,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:04,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-08 05:23:05,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:05,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744958685] [2025-03-08 05:23:05,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744958685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:05,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:23:05,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:23:05,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874146034] [2025-03-08 05:23:05,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:05,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:23:05,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:05,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:23:05,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:23:05,026 INFO L87 Difference]: Start difference. First operand 3454 states and 5731 transitions. Second operand has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:23:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:05,171 INFO L93 Difference]: Finished difference Result 6734 states and 11202 transitions. [2025-03-08 05:23:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:23:05,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 172 [2025-03-08 05:23:05,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:05,191 INFO L225 Difference]: With dead ends: 6734 [2025-03-08 05:23:05,191 INFO L226 Difference]: Without dead ends: 3187 [2025-03-08 05:23:05,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:23:05,202 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 30 mSDsluCounter, 4782 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 5584 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:23:05,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 5584 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:23:05,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states. [2025-03-08 05:23:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 3175. [2025-03-08 05:23:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 2618 states have (on average 1.6844919786096257) internal successors, (4410), 2693 states have internal predecessors, (4410), 383 states have call successors, (383), 155 states have call predecessors, (383), 173 states have return successors, (483), 374 states have call predecessors, (483), 379 states have call successors, (483) [2025-03-08 05:23:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 5276 transitions. [2025-03-08 05:23:05,306 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 5276 transitions. Word has length 172 [2025-03-08 05:23:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:05,306 INFO L471 AbstractCegarLoop]: Abstraction has 3175 states and 5276 transitions. [2025-03-08 05:23:05,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:23:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 5276 transitions. [2025-03-08 05:23:05,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 05:23:05,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:05,316 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:23:05,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 05:23:05,316 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:05,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:05,316 INFO L85 PathProgramCache]: Analyzing trace with hash 451318080, now seen corresponding path program 1 times [2025-03-08 05:23:05,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:05,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948396593] [2025-03-08 05:23:05,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:05,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:05,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 05:23:05,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 05:23:05,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:05,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 36 proven. 101 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2025-03-08 05:23:05,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:05,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948396593] [2025-03-08 05:23:05,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948396593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:05,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916133831] [2025-03-08 05:23:05,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:05,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:05,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:05,768 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:23:05,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 05:23:05,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 05:23:06,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 05:23:06,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:06,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:06,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 3188 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 05:23:06,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 343 proven. 50 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2025-03-08 05:23:06,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:23:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 57 proven. 93 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2025-03-08 05:23:07,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916133831] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:23:07,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:23:07,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 14] total 27 [2025-03-08 05:23:07,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341366501] [2025-03-08 05:23:07,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:23:07,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 05:23:07,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:07,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 05:23:07,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:23:07,407 INFO L87 Difference]: Start difference. First operand 3175 states and 5276 transitions. Second operand has 27 states, 25 states have (on average 14.72) internal successors, (368), 23 states have internal predecessors, (368), 17 states have call successors, (89), 8 states have call predecessors, (89), 14 states have return successors, (90), 20 states have call predecessors, (90), 17 states have call successors, (90) [2025-03-08 05:23:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:39,834 INFO L93 Difference]: Finished difference Result 34949 states and 59765 transitions. [2025-03-08 05:23:39,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 352 states. [2025-03-08 05:23:39,835 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 14.72) internal successors, (368), 23 states have internal predecessors, (368), 17 states have call successors, (89), 8 states have call predecessors, (89), 14 states have return successors, (90), 20 states have call predecessors, (90), 17 states have call successors, (90) Word has length 460 [2025-03-08 05:23:39,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:40,011 INFO L225 Difference]: With dead ends: 34949 [2025-03-08 05:23:40,012 INFO L226 Difference]: Without dead ends: 31456 [2025-03-08 05:23:40,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1377 GetRequests, 1005 SyntacticMatches, 4 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61282 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=10952, Invalid=125578, Unknown=0, NotChecked=0, Total=136530 [2025-03-08 05:23:40,076 INFO L435 NwaCegarLoop]: 2176 mSDtfsCounter, 30595 mSDsluCounter, 20367 mSDsCounter, 0 mSdLazyCounter, 67301 mSolverCounterSat, 10741 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30595 SdHoareTripleChecker+Valid, 22543 SdHoareTripleChecker+Invalid, 78042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 10741 IncrementalHoareTripleChecker+Valid, 67301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:23:40,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30595 Valid, 22543 Invalid, 78042 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [10741 Valid, 67301 Invalid, 0 Unknown, 0 Unchecked, 24.8s Time] [2025-03-08 05:23:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31456 states. [2025-03-08 05:23:41,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31456 to 26358. [2025-03-08 05:23:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26358 states, 21821 states have (on average 1.6608313092892169) internal successors, (36241), 22406 states have internal predecessors, (36241), 3011 states have call successors, (3011), 1396 states have call predecessors, (3011), 1525 states have return successors, (4204), 2975 states have call predecessors, (4204), 2993 states have call successors, (4204) [2025-03-08 05:23:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26358 states to 26358 states and 43456 transitions. [2025-03-08 05:23:41,480 INFO L78 Accepts]: Start accepts. Automaton has 26358 states and 43456 transitions. Word has length 460 [2025-03-08 05:23:41,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:41,480 INFO L471 AbstractCegarLoop]: Abstraction has 26358 states and 43456 transitions. [2025-03-08 05:23:41,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 14.72) internal successors, (368), 23 states have internal predecessors, (368), 17 states have call successors, (89), 8 states have call predecessors, (89), 14 states have return successors, (90), 20 states have call predecessors, (90), 17 states have call successors, (90) [2025-03-08 05:23:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 26358 states and 43456 transitions. [2025-03-08 05:23:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-03-08 05:23:41,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:41,562 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:23:41,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 05:23:41,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:41,763 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:41,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:41,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1906133276, now seen corresponding path program 1 times [2025-03-08 05:23:41,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:41,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630114769] [2025-03-08 05:23:41,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:41,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:41,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-03-08 05:23:41,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-03-08 05:23:41,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:41,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 61 proven. 70 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2025-03-08 05:23:42,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:42,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630114769] [2025-03-08 05:23:42,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630114769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:42,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731434494] [2025-03-08 05:23:42,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:42,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:42,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:42,253 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:23:42,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 05:23:42,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-03-08 05:23:42,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-03-08 05:23:42,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:42,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:42,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 3365 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:23:42,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 628 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-03-08 05:23:42,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:42,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731434494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:42,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:42,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 05:23:42,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848899096] [2025-03-08 05:23:42,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:42,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:23:42,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:42,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:23:42,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:23:42,753 INFO L87 Difference]: Start difference. First operand 26358 states and 43456 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 2 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-08 05:23:43,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:43,769 INFO L93 Difference]: Finished difference Result 50300 states and 83205 transitions. [2025-03-08 05:23:43,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:23:43,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 2 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 523 [2025-03-08 05:23:43,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:43,917 INFO L225 Difference]: With dead ends: 50300 [2025-03-08 05:23:43,917 INFO L226 Difference]: Without dead ends: 28920 [2025-03-08 05:23:43,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:23:43,982 INFO L435 NwaCegarLoop]: 1469 mSDtfsCounter, 718 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:23:43,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 2196 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:23:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28920 states. [2025-03-08 05:23:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28920 to 28907. [2025-03-08 05:23:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28907 states, 23926 states have (on average 1.6578617403661289) internal successors, (39666), 24564 states have internal predecessors, (39666), 3303 states have call successors, (3303), 1541 states have call predecessors, (3303), 1677 states have return successors, (4678), 3257 states have call predecessors, (4678), 3283 states have call successors, (4678) [2025-03-08 05:23:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28907 states to 28907 states and 47647 transitions. [2025-03-08 05:23:45,031 INFO L78 Accepts]: Start accepts. Automaton has 28907 states and 47647 transitions. Word has length 523 [2025-03-08 05:23:45,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:45,032 INFO L471 AbstractCegarLoop]: Abstraction has 28907 states and 47647 transitions. [2025-03-08 05:23:45,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 2 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-08 05:23:45,032 INFO L276 IsEmpty]: Start isEmpty. Operand 28907 states and 47647 transitions. [2025-03-08 05:23:45,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-08 05:23:45,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:45,107 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:23:45,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-08 05:23:45,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:45,308 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:45,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:45,308 INFO L85 PathProgramCache]: Analyzing trace with hash 812339141, now seen corresponding path program 1 times [2025-03-08 05:23:45,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:45,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146472625] [2025-03-08 05:23:45,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:45,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:45,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-08 05:23:45,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-08 05:23:45,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:45,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 61 proven. 70 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2025-03-08 05:23:45,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:45,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146472625] [2025-03-08 05:23:45,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146472625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:45,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048557144] [2025-03-08 05:23:45,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:45,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:45,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:45,747 INFO L229 MonitoredProcess]: Starting monitored process 21 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:23:45,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 05:23:46,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-08 05:23:46,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-08 05:23:46,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:46,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:46,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 3320 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:23:46,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:46,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-03-08 05:23:46,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:46,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048557144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:46,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:46,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-08 05:23:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868730002] [2025-03-08 05:23:46,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:46,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:23:46,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:46,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:23:46,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:23:46,426 INFO L87 Difference]: Start difference. First operand 28907 states and 47647 transitions. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 5 states have internal predecessors, (233), 2 states have call successors, (42), 2 states have call predecessors, (42), 3 states have return successors, (41), 3 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-08 05:23:47,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:47,361 INFO L93 Difference]: Finished difference Result 58006 states and 95835 transitions. [2025-03-08 05:23:47,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:23:47,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 5 states have internal predecessors, (233), 2 states have call successors, (42), 2 states have call predecessors, (42), 3 states have return successors, (41), 3 states have call predecessors, (41), 2 states have call successors, (41) Word has length 502 [2025-03-08 05:23:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:47,526 INFO L225 Difference]: With dead ends: 58006 [2025-03-08 05:23:47,526 INFO L226 Difference]: Without dead ends: 29168 [2025-03-08 05:23:47,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:23:47,764 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 0 mSDsluCounter, 3259 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4076 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:23:47,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4076 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:23:47,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29168 states. [2025-03-08 05:23:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29168 to 29061. [2025-03-08 05:23:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29061 states, 24039 states have (on average 1.654769333166937) internal successors, (39779), 24694 states have internal predecessors, (39779), 3303 states have call successors, (3303), 1541 states have call predecessors, (3303), 1718 states have return successors, (4726), 3281 states have call predecessors, (4726), 3283 states have call successors, (4726) [2025-03-08 05:23:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29061 states to 29061 states and 47808 transitions. [2025-03-08 05:23:48,866 INFO L78 Accepts]: Start accepts. Automaton has 29061 states and 47808 transitions. Word has length 502 [2025-03-08 05:23:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:48,867 INFO L471 AbstractCegarLoop]: Abstraction has 29061 states and 47808 transitions. [2025-03-08 05:23:48,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 5 states have internal predecessors, (233), 2 states have call successors, (42), 2 states have call predecessors, (42), 3 states have return successors, (41), 3 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-08 05:23:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 29061 states and 47808 transitions. [2025-03-08 05:23:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2025-03-08 05:23:48,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:48,940 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:23:48,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-08 05:23:49,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-08 05:23:49,141 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:49,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:49,142 INFO L85 PathProgramCache]: Analyzing trace with hash 564142538, now seen corresponding path program 1 times [2025-03-08 05:23:49,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:49,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438649046] [2025-03-08 05:23:49,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:49,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:49,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-03-08 05:23:49,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-03-08 05:23:49,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:49,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 61 proven. 70 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2025-03-08 05:23:49,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:49,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438649046] [2025-03-08 05:23:49,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438649046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:49,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317632940] [2025-03-08 05:23:49,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:49,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:49,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:49,463 INFO L229 MonitoredProcess]: Starting monitored process 22 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:23:49,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 05:23:49,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-03-08 05:23:49,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-03-08 05:23:49,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:49,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:49,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 3370 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:23:49,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 528 proven. 25 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2025-03-08 05:23:50,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:23:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 68 proven. 43 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [2025-03-08 05:23:50,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317632940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:23:50,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:23:50,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2025-03-08 05:23:50,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216504040] [2025-03-08 05:23:50,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:23:50,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 05:23:50,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:50,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 05:23:50,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:23:50,691 INFO L87 Difference]: Start difference. First operand 29061 states and 47808 transitions. Second operand has 18 states, 17 states have (on average 24.058823529411764) internal successors, (409), 16 states have internal predecessors, (409), 13 states have call successors, (102), 7 states have call predecessors, (102), 13 states have return successors, (101), 14 states have call predecessors, (101), 13 states have call successors, (101) [2025-03-08 05:23:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:59,927 INFO L93 Difference]: Finished difference Result 87587 states and 147824 transitions. [2025-03-08 05:23:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-08 05:23:59,928 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 24.058823529411764) internal successors, (409), 16 states have internal predecessors, (409), 13 states have call successors, (102), 7 states have call predecessors, (102), 13 states have return successors, (101), 14 states have call predecessors, (101), 13 states have call successors, (101) Word has length 513 [2025-03-08 05:23:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:24:00,225 INFO L225 Difference]: With dead ends: 87587 [2025-03-08 05:24:00,225 INFO L226 Difference]: Without dead ends: 59245