./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec14_product03.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec14_product03.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 8ed4163e8f042a84d9cdccd4fee3ee0ba89fdce83cd991779acec4a51d9a650c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:11:35,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:11:35,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:11:35,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:11:35,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:11:35,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:11:35,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:11:35,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:11:35,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:11:35,217 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:11:35,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:11:35,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:11:35,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:11:35,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:11:35,218 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:11:35,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:11:35,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:11:35,218 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:11:35,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:11:35,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:11:35,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:11:35,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:11:35,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:11:35,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:11:35,219 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:11:35,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:11:35,219 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:11:35,219 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:11:35,219 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:11:35,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:11:35,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:11:35,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:11:35,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:11:35,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:11:35,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:11:35,220 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:11:35,220 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:11:35,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:11:35,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:11:35,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:11:35,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:11:35,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:11:35,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:11:35,221 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 -> 8ed4163e8f042a84d9cdccd4fee3ee0ba89fdce83cd991779acec4a51d9a650c [2025-03-03 14:11:35,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:11:35,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:11:35,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:11:35,455 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:11:35,455 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:11:35,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec14_product03.cil.c [2025-03-03 14:11:36,581 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9b5e0f8/e704524227654c2a9fe3fc6ceadda174/FLAGc8499576a [2025-03-03 14:11:36,885 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:11:36,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product03.cil.c [2025-03-03 14:11:36,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9b5e0f8/e704524227654c2a9fe3fc6ceadda174/FLAGc8499576a [2025-03-03 14:11:37,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9b5e0f8/e704524227654c2a9fe3fc6ceadda174 [2025-03-03 14:11:37,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:11:37,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:11:37,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:11:37,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:11:37,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:11:37,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:11:37" (1/1) ... [2025-03-03 14:11:37,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:37, skipping insertion in model container [2025-03-03 14:11:37,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:11:37" (1/1) ... [2025-03-03 14:11:37,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:11:37,516 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_product03.cil.c[68958,68971] [2025-03-03 14:11:37,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:11:37,534 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:11:37,539 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [48] [2025-03-03 14:11:37,540 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [169] [2025-03-03 14:11:37,540 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [268] [2025-03-03 14:11:37,540 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [935] [2025-03-03 14:11:37,541 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [976] [2025-03-03 14:11:37,541 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [994] [2025-03-03 14:11:37,541 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1346] [2025-03-03 14:11:37,541 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1712] [2025-03-03 14:11:37,541 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1747] [2025-03-03 14:11:37,541 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3244] [2025-03-03 14:11:37,619 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_product03.cil.c[68958,68971] [2025-03-03 14:11:37,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:11:37,639 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:11:37,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:37 WrapperNode [2025-03-03 14:11:37,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:11:37,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:11:37,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:11:37,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:11:37,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:37" (1/1) ... [2025-03-03 14:11:37,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:37" (1/1) ... [2025-03-03 14:11:37,703 INFO L138 Inliner]: procedures = 89, calls = 329, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 999 [2025-03-03 14:11:37,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:11:37,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:11:37,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:11:37,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:11:37,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:37" (1/1) ... [2025-03-03 14:11:37,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:37" (1/1) ... [2025-03-03 14:11:37,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:37" (1/1) ... [2025-03-03 14:11:37,730 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-03 14:11:37,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:37" (1/1) ... [2025-03-03 14:11:37,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:37" (1/1) ... [2025-03-03 14:11:37,741 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:37" (1/1) ... [2025-03-03 14:11:37,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:37" (1/1) ... [2025-03-03 14:11:37,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:37" (1/1) ... [2025-03-03 14:11:37,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:37" (1/1) ... [2025-03-03 14:11:37,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:11:37,762 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:11:37,762 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:11:37,763 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:11:37,763 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:37" (1/1) ... [2025-03-03 14:11:37,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:11:37,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:37,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:11:37,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:11:37,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:11:37,809 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:11:37,809 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:11:37,809 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:11:37,810 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:11:37,810 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-03 14:11:37,810 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-03 14:11:37,810 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:11:37,810 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:11:37,810 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-03 14:11:37,810 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-03 14:11:37,810 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:11:37,810 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:11:37,810 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:11:37,810 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:11:37,810 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:11:37,810 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:11:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:11:37,811 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:11:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:11:37,811 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:11:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:11:37,811 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:11:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-03 14:11:37,811 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-03 14:11:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:11:37,811 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:11:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:11:37,811 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:11:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:11:37,811 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:11:37,812 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:11:37,812 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__base [2025-03-03 14:11:37,812 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__base [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:11:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:11:37,813 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:11:37,813 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:11:37,813 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:11:37,813 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:11:37,813 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:11:37,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:11:37,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:11:37,813 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:11:37,813 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:11:37,965 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:11:37,967 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:11:38,015 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: #res := ~retValue_acc~2; [2025-03-03 14:11:38,019 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1819: #res := ~retValue_acc~13; [2025-03-03 14:11:38,030 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1948: #res := ~retValue_acc~14; [2025-03-03 14:11:38,064 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: #res := ~retValue_acc~28; [2025-03-03 14:11:38,315 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2514: #res#1 := ~retValue_acc~22#1; [2025-03-03 14:11:38,316 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2485-1: stopRequestedInDirection__wrappee__base_#res#1 := stopRequestedInDirection__wrappee__base_~retValue_acc~21#1; [2025-03-03 14:11:38,374 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2649: #res := ~retValue_acc~26; [2025-03-03 14:11:38,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: #res := ~retValue_acc~1; [2025-03-03 14:11:38,417 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2604: #res#1 := ~retValue_acc~24#1; [2025-03-03 14:11:38,419 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~16#1; [2025-03-03 14:11:38,482 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2133-1: isIdle_#res#1 := isIdle_~retValue_acc~20#1; [2025-03-03 14:11:38,482 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2120-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~19#1; [2025-03-03 14:11:38,588 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3241-1: isExecutiveFloor_#res#1 := isExecutiveFloor_~retValue_acc~29#1; [2025-03-03 14:11:38,589 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1957-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; [2025-03-03 14:11:38,589 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2635-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~25#1; [2025-03-03 14:11:38,646 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L621: #res := ~retValue_acc~4; [2025-03-03 14:11:38,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1343-1: main_#res#1 := main_~retValue_acc~7#1; [2025-03-03 14:11:38,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1744-1: valid_product_#res#1 := valid_product_~retValue_acc~12#1; [2025-03-03 14:11:38,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: #res := ~retValue_acc~3; [2025-03-03 14:11:38,724 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L932: #res := ~retValue_acc~5; [2025-03-03 14:11:38,849 INFO L? ?]: Removed 422 outVars from TransFormulas that were not future-live. [2025-03-03 14:11:38,850 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:11:38,876 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:11:38,876 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:11:38,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:11:38 BoogieIcfgContainer [2025-03-03 14:11:38,877 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:11:38,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:11:38,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:11:38,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:11:38,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:11:37" (1/3) ... [2025-03-03 14:11:38,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c511b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:11:38, skipping insertion in model container [2025-03-03 14:11:38,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:11:37" (2/3) ... [2025-03-03 14:11:38,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c511b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:11:38, skipping insertion in model container [2025-03-03 14:11:38,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:11:38" (3/3) ... [2025-03-03 14:11:38,887 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product03.cil.c [2025-03-03 14:11:38,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:11:38,898 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec14_product03.cil.c that has 23 procedures, 516 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:11:38,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:11:38,962 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;@18c1b578, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:11:38,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:11:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 516 states, 401 states have (on average 1.680798004987531) internal successors, (674), 417 states have internal predecessors, (674), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:11:38,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 14:11:38,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:38,989 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-03 14:11:38,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:38,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:38,993 INFO L85 PathProgramCache]: Analyzing trace with hash -865093116, now seen corresponding path program 1 times [2025-03-03 14:11:38,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:38,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946259969] [2025-03-03 14:11:38,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:38,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:39,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:11:39,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:11:39,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:39,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:39,420 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-03 14:11:39,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:39,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946259969] [2025-03-03 14:11:39,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946259969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:39,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:39,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:11:39,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725644097] [2025-03-03 14:11:39,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:39,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:39,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:39,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:39,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:39,447 INFO L87 Difference]: Start difference. First operand has 516 states, 401 states have (on average 1.680798004987531) internal successors, (674), 417 states have internal predecessors, (674), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) 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-03 14:11:39,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:39,588 INFO L93 Difference]: Finished difference Result 1025 states and 1712 transitions. [2025-03-03 14:11:39,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:11:39,591 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-03 14:11:39,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:39,603 INFO L225 Difference]: With dead ends: 1025 [2025-03-03 14:11:39,603 INFO L226 Difference]: Without dead ends: 511 [2025-03-03 14:11:39,609 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-03 14:11:39,610 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 6 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2514 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-03 14:11:39,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2514 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-03 14:11:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-03-03 14:11:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 397 states have (on average 1.672544080604534) internal successors, (664), 412 states have internal predecessors, (664), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 14:11:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 845 transitions. [2025-03-03 14:11:39,689 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 845 transitions. Word has length 101 [2025-03-03 14:11:39,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:39,689 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 845 transitions. [2025-03-03 14:11:39,689 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-03 14:11:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 845 transitions. [2025-03-03 14:11:39,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:11:39,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:39,696 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-03 14:11:39,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:11:39,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:39,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:39,698 INFO L85 PathProgramCache]: Analyzing trace with hash -383112740, now seen corresponding path program 1 times [2025-03-03 14:11:39,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:39,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594879934] [2025-03-03 14:11:39,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:39,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:39,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:11:39,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:11:39,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:39,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:39,896 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-03 14:11:39,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:39,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594879934] [2025-03-03 14:11:39,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594879934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:39,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:39,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:11:39,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250166025] [2025-03-03 14:11:39,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:39,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:39,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:39,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:39,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:39,898 INFO L87 Difference]: Start difference. First operand 511 states and 845 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-03 14:11:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:39,979 INFO L93 Difference]: Finished difference Result 1005 states and 1667 transitions. [2025-03-03 14:11:39,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:11:39,979 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-03 14:11:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:39,985 INFO L225 Difference]: With dead ends: 1005 [2025-03-03 14:11:39,986 INFO L226 Difference]: Without dead ends: 511 [2025-03-03 14:11:39,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:39,990 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 4 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2486 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-03 14:11:39,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2486 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:39,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-03 14:11:40,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-03-03 14:11:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 397 states have (on average 1.6700251889168767) internal successors, (663), 412 states have internal predecessors, (663), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 14:11:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 844 transitions. [2025-03-03 14:11:40,025 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 844 transitions. Word has length 102 [2025-03-03 14:11:40,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:40,025 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 844 transitions. [2025-03-03 14:11:40,025 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-03 14:11:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 844 transitions. [2025-03-03 14:11:40,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:11:40,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:40,030 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-03 14:11:40,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:11:40,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:40,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:40,031 INFO L85 PathProgramCache]: Analyzing trace with hash 257523361, now seen corresponding path program 1 times [2025-03-03 14:11:40,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:40,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799812693] [2025-03-03 14:11:40,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:40,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:40,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:11:40,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:11:40,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:40,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:40,168 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-03 14:11:40,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:40,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799812693] [2025-03-03 14:11:40,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799812693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:40,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:40,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:11:40,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749747457] [2025-03-03 14:11:40,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:40,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:40,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:40,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:40,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:40,170 INFO L87 Difference]: Start difference. First operand 511 states and 844 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-03 14:11:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:40,221 INFO L93 Difference]: Finished difference Result 1005 states and 1666 transitions. [2025-03-03 14:11:40,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:11:40,222 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-03 14:11:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:40,225 INFO L225 Difference]: With dead ends: 1005 [2025-03-03 14:11:40,225 INFO L226 Difference]: Without dead ends: 511 [2025-03-03 14:11:40,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:40,228 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 3 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2486 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-03 14:11:40,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2486 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-03 14:11:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-03-03 14:11:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 397 states have (on average 1.6675062972292192) internal successors, (662), 412 states have internal predecessors, (662), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 14:11:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 843 transitions. [2025-03-03 14:11:40,251 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 843 transitions. Word has length 103 [2025-03-03 14:11:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:40,252 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 843 transitions. [2025-03-03 14:11:40,252 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-03 14:11:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 843 transitions. [2025-03-03 14:11:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:11:40,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:40,256 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-03 14:11:40,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:11:40,257 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:40,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:40,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1521519641, now seen corresponding path program 1 times [2025-03-03 14:11:40,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:40,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385301992] [2025-03-03 14:11:40,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:40,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:40,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:11:40,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:11:40,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:40,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:40,362 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-03 14:11:40,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:40,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385301992] [2025-03-03 14:11:40,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385301992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:40,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:40,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:11:40,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987131015] [2025-03-03 14:11:40,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:40,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:40,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:40,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:40,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:40,365 INFO L87 Difference]: Start difference. First operand 511 states and 843 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-03 14:11:40,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:40,423 INFO L93 Difference]: Finished difference Result 1005 states and 1665 transitions. [2025-03-03 14:11:40,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:11:40,424 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-03 14:11:40,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:40,428 INFO L225 Difference]: With dead ends: 1005 [2025-03-03 14:11:40,428 INFO L226 Difference]: Without dead ends: 511 [2025-03-03 14:11:40,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:40,433 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 2 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2486 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-03 14:11:40,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2486 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-03 14:11:40,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-03-03 14:11:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 397 states have (on average 1.6649874055415617) internal successors, (661), 412 states have internal predecessors, (661), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 14:11:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 842 transitions. [2025-03-03 14:11:40,458 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 842 transitions. Word has length 104 [2025-03-03 14:11:40,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:40,458 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 842 transitions. [2025-03-03 14:11:40,458 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-03 14:11:40,458 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 842 transitions. [2025-03-03 14:11:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:11:40,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:40,462 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-03 14:11:40,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:11:40,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:40,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:40,463 INFO L85 PathProgramCache]: Analyzing trace with hash 634844990, now seen corresponding path program 1 times [2025-03-03 14:11:40,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:40,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182009183] [2025-03-03 14:11:40,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:40,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:40,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:11:40,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:11:40,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:40,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:40,589 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-03 14:11:40,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182009183] [2025-03-03 14:11:40,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182009183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:40,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:40,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:11:40,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475685652] [2025-03-03 14:11:40,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:40,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:40,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:40,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:40,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:40,592 INFO L87 Difference]: Start difference. First operand 511 states and 842 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-03 14:11:40,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:40,631 INFO L93 Difference]: Finished difference Result 1005 states and 1664 transitions. [2025-03-03 14:11:40,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:11:40,632 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-03 14:11:40,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:40,636 INFO L225 Difference]: With dead ends: 1005 [2025-03-03 14:11:40,636 INFO L226 Difference]: Without dead ends: 511 [2025-03-03 14:11:40,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:40,639 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 1 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2486 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-03 14:11:40,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2486 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:40,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-03 14:11:40,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-03-03 14:11:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 397 states have (on average 1.6624685138539044) internal successors, (660), 412 states have internal predecessors, (660), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 14:11:40,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 841 transitions. [2025-03-03 14:11:40,660 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 841 transitions. Word has length 105 [2025-03-03 14:11:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:40,660 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 841 transitions. [2025-03-03 14:11:40,661 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-03 14:11:40,661 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 841 transitions. [2025-03-03 14:11:40,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 14:11:40,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:40,663 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-03 14:11:40,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:11:40,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:40,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1796848214, now seen corresponding path program 1 times [2025-03-03 14:11:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:40,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145887497] [2025-03-03 14:11:40,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:40,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:40,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 14:11:40,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 14:11:40,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:40,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:40,852 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-03 14:11:40,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:40,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145887497] [2025-03-03 14:11:40,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145887497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:40,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:40,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:11:40,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147992358] [2025-03-03 14:11:40,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:40,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:11:40,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:40,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:11:40,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:11:40,853 INFO L87 Difference]: Start difference. First operand 511 states and 841 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-03 14:11:40,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:40,981 INFO L93 Difference]: Finished difference Result 1016 states and 1681 transitions. [2025-03-03 14:11:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:11:40,985 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-03 14:11:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:40,991 INFO L225 Difference]: With dead ends: 1016 [2025-03-03 14:11:40,991 INFO L226 Difference]: Without dead ends: 526 [2025-03-03 14:11:40,994 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-03 14:11:40,994 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 91 mSDsluCounter, 5695 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6521 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-03 14:11:40,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6521 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:40,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-03 14:11:41,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 524. [2025-03-03 14:11:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 407 states have (on average 1.6584766584766584) internal successors, (675), 424 states have internal predecessors, (675), 92 states have call successors, (92), 23 states have call predecessors, (92), 24 states have return successors, (94), 89 states have call predecessors, (94), 91 states have call successors, (94) [2025-03-03 14:11:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 861 transitions. [2025-03-03 14:11:41,021 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 861 transitions. Word has length 106 [2025-03-03 14:11:41,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:41,022 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 861 transitions. [2025-03-03 14:11:41,022 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-03 14:11:41,022 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 861 transitions. [2025-03-03 14:11:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 14:11:41,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:41,041 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-03 14:11:41,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:11:41,041 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:41,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:41,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1559587467, now seen corresponding path program 1 times [2025-03-03 14:11:41,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:41,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360128340] [2025-03-03 14:11:41,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:41,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:41,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 14:11:41,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 14:11:41,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:41,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:41,124 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-03 14:11:41,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:41,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360128340] [2025-03-03 14:11:41,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360128340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:41,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:41,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:11:41,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223883056] [2025-03-03 14:11:41,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:41,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:41,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:41,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:41,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:11:41,125 INFO L87 Difference]: Start difference. First operand 524 states and 861 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-03 14:11:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:41,171 INFO L93 Difference]: Finished difference Result 1023 states and 1692 transitions. [2025-03-03 14:11:41,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:11:41,172 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-03 14:11:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:41,175 INFO L225 Difference]: With dead ends: 1023 [2025-03-03 14:11:41,175 INFO L226 Difference]: Without dead ends: 520 [2025-03-03 14:11:41,177 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-03 14:11:41,177 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 1 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2481 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-03 14:11:41,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2481 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:41,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-03 14:11:41,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2025-03-03 14:11:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 405 states have (on average 1.6592592592592592) internal successors, (672), 421 states have internal predecessors, (672), 91 states have call successors, (91), 23 states have call predecessors, (91), 23 states have return successors, (91), 88 states have call predecessors, (91), 90 states have call successors, (91) [2025-03-03 14:11:41,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 854 transitions. [2025-03-03 14:11:41,193 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 854 transitions. Word has length 106 [2025-03-03 14:11:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:41,194 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 854 transitions. [2025-03-03 14:11:41,194 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-03 14:11:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 854 transitions. [2025-03-03 14:11:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 14:11:41,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:41,196 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-03 14:11:41,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:11:41,196 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:41,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:41,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1222453859, now seen corresponding path program 1 times [2025-03-03 14:11:41,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:41,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607234978] [2025-03-03 14:11:41,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:41,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:41,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:11:41,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:11:41,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:41,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:41,300 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-03 14:11:41,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:41,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607234978] [2025-03-03 14:11:41,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607234978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:41,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:41,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:11:41,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735802888] [2025-03-03 14:11:41,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:41,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:11:41,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:41,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:11:41,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:11:41,301 INFO L87 Difference]: Start difference. First operand 520 states and 854 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-03 14:11:41,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:41,512 INFO L93 Difference]: Finished difference Result 1066 states and 1764 transitions. [2025-03-03 14:11:41,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:11:41,512 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-03 14:11:41,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:41,515 INFO L225 Difference]: With dead ends: 1066 [2025-03-03 14:11:41,515 INFO L226 Difference]: Without dead ends: 552 [2025-03-03 14:11:41,517 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-03 14:11:41,518 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 72 mSDsluCounter, 3133 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 3936 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-03 14:11:41,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 3936 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:11:41,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-03 14:11:41,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 525. [2025-03-03 14:11:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 410 states have (on average 1.6439024390243901) internal successors, (674), 425 states have internal predecessors, (674), 91 states have call successors, (91), 24 states have call predecessors, (91), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 14:11:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 855 transitions. [2025-03-03 14:11:41,534 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 855 transitions. Word has length 107 [2025-03-03 14:11:41,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:41,534 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 855 transitions. [2025-03-03 14:11:41,534 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-03 14:11:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 855 transitions. [2025-03-03 14:11:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:11:41,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:41,536 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-03 14:11:41,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:11:41,536 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:41,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:41,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1676626189, now seen corresponding path program 1 times [2025-03-03 14:11:41,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:41,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47644595] [2025-03-03 14:11:41,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:41,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:41,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:11:41,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:11:41,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:41,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:41,652 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-03 14:11:41,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:41,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47644595] [2025-03-03 14:11:41,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47644595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:41,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:41,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:11:41,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984363602] [2025-03-03 14:11:41,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:41,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:11:41,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:41,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:11:41,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:11:41,654 INFO L87 Difference]: Start difference. First operand 525 states and 855 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-03 14:11:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:41,835 INFO L93 Difference]: Finished difference Result 1017 states and 1659 transitions. [2025-03-03 14:11:41,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:11:41,836 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-03 14:11:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:41,839 INFO L225 Difference]: With dead ends: 1017 [2025-03-03 14:11:41,839 INFO L226 Difference]: Without dead ends: 543 [2025-03-03 14:11:41,843 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-03 14:11:41,844 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 56 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3913 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-03 14:11:41,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 3913 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:41,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-03 14:11:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 525. [2025-03-03 14:11:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 410 states have (on average 1.6341463414634145) internal successors, (670), 425 states have internal predecessors, (670), 91 states have call successors, (91), 24 states have call predecessors, (91), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 14:11:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 851 transitions. [2025-03-03 14:11:41,861 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 851 transitions. Word has length 108 [2025-03-03 14:11:41,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:41,861 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 851 transitions. [2025-03-03 14:11:41,861 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-03 14:11:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 851 transitions. [2025-03-03 14:11:41,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:11:41,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:41,863 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-03 14:11:41,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:11:41,864 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:41,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1747869856, now seen corresponding path program 1 times [2025-03-03 14:11:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:41,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231888716] [2025-03-03 14:11:41,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:41,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:41,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:11:41,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:11:41,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:41,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:41,962 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-03 14:11:41,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:41,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231888716] [2025-03-03 14:11:41,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231888716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:41,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:41,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:11:41,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777328387] [2025-03-03 14:11:41,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:41,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:11:41,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:41,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:11:41,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:11:41,963 INFO L87 Difference]: Start difference. First operand 525 states and 851 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-03 14:11:42,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:42,109 INFO L93 Difference]: Finished difference Result 1017 states and 1655 transitions. [2025-03-03 14:11:42,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:11:42,109 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-03 14:11:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:42,113 INFO L225 Difference]: With dead ends: 1017 [2025-03-03 14:11:42,113 INFO L226 Difference]: Without dead ends: 543 [2025-03-03 14:11:42,115 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-03 14:11:42,115 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 55 mSDsluCounter, 3117 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 3908 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-03 14:11:42,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 3908 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:42,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-03 14:11:42,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 525. [2025-03-03 14:11:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 410 states have (on average 1.6243902439024391) internal successors, (666), 425 states have internal predecessors, (666), 91 states have call successors, (91), 24 states have call predecessors, (91), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 14:11:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 847 transitions. [2025-03-03 14:11:42,130 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 847 transitions. Word has length 109 [2025-03-03 14:11:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:42,131 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 847 transitions. [2025-03-03 14:11:42,131 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-03 14:11:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 847 transitions. [2025-03-03 14:11:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:11:42,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:42,133 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-03 14:11:42,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:11:42,133 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:42,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:42,134 INFO L85 PathProgramCache]: Analyzing trace with hash 574403087, now seen corresponding path program 1 times [2025-03-03 14:11:42,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:42,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108717572] [2025-03-03 14:11:42,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:42,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:42,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:11:42,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:11:42,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:42,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:42,257 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-03 14:11:42,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:42,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108717572] [2025-03-03 14:11:42,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108717572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:42,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:42,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:11:42,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927703924] [2025-03-03 14:11:42,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:42,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:11:42,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:42,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:11:42,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:11:42,259 INFO L87 Difference]: Start difference. First operand 525 states and 847 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-03 14:11:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:42,334 INFO L93 Difference]: Finished difference Result 1008 states and 1637 transitions. [2025-03-03 14:11:42,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:11:42,335 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-03 14:11:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:42,338 INFO L225 Difference]: With dead ends: 1008 [2025-03-03 14:11:42,338 INFO L226 Difference]: Without dead ends: 513 [2025-03-03 14:11:42,341 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-03 14:11:42,341 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 94 mSDsluCounter, 3989 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 4806 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-03 14:11:42,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 4806 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-03 14:11:42,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 504. [2025-03-03 14:11:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 389 states have (on average 1.6169665809768639) internal successors, (629), 404 states have internal predecessors, (629), 91 states have call successors, (91), 24 states have call predecessors, (91), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 14:11:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 810 transitions. [2025-03-03 14:11:42,359 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 810 transitions. Word has length 109 [2025-03-03 14:11:42,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:42,359 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 810 transitions. [2025-03-03 14:11:42,359 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-03 14:11:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 810 transitions. [2025-03-03 14:11:42,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:11:42,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:42,361 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-03 14:11:42,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:11:42,362 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:42,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:42,362 INFO L85 PathProgramCache]: Analyzing trace with hash 55531632, now seen corresponding path program 1 times [2025-03-03 14:11:42,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:42,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380987952] [2025-03-03 14:11:42,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:42,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:42,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:11:42,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:11:42,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:42,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:42,469 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-03 14:11:42,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:42,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380987952] [2025-03-03 14:11:42,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380987952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:42,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:42,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:11:42,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767338320] [2025-03-03 14:11:42,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:42,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:11:42,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:42,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:11:42,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:11:42,471 INFO L87 Difference]: Start difference. First operand 504 states and 810 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-03 14:11:42,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:42,552 INFO L93 Difference]: Finished difference Result 987 states and 1600 transitions. [2025-03-03 14:11:42,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:11:42,553 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-03 14:11:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:42,556 INFO L225 Difference]: With dead ends: 987 [2025-03-03 14:11:42,557 INFO L226 Difference]: Without dead ends: 513 [2025-03-03 14:11:42,559 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-03 14:11:42,560 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 39 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3913 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-03 14:11:42,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3913 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:42,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-03 14:11:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 504. [2025-03-03 14:11:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 389 states have (on average 1.6143958868894601) internal successors, (628), 404 states have internal predecessors, (628), 91 states have call successors, (91), 24 states have call predecessors, (91), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 14:11:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 809 transitions. [2025-03-03 14:11:42,577 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 809 transitions. Word has length 110 [2025-03-03 14:11:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:42,578 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 809 transitions. [2025-03-03 14:11:42,578 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-03 14:11:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 809 transitions. [2025-03-03 14:11:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:11:42,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:42,580 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-03 14:11:42,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:11:42,580 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:42,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:42,581 INFO L85 PathProgramCache]: Analyzing trace with hash -473270365, now seen corresponding path program 1 times [2025-03-03 14:11:42,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:42,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670794069] [2025-03-03 14:11:42,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:42,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:42,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:11:42,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:11:42,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:42,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:42,672 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-03 14:11:42,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:42,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670794069] [2025-03-03 14:11:42,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670794069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:42,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:42,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:11:42,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312861317] [2025-03-03 14:11:42,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:42,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:11:42,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:42,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:11:42,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:11:42,673 INFO L87 Difference]: Start difference. First operand 504 states and 809 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-03 14:11:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:42,750 INFO L93 Difference]: Finished difference Result 987 states and 1599 transitions. [2025-03-03 14:11:42,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:11:42,751 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-03 14:11:42,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:42,754 INFO L225 Difference]: With dead ends: 987 [2025-03-03 14:11:42,754 INFO L226 Difference]: Without dead ends: 513 [2025-03-03 14:11:42,756 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-03 14:11:42,756 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 38 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3913 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:42,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3913 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:42,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-03 14:11:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 504. [2025-03-03 14:11:42,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 389 states have (on average 1.6118251928020566) internal successors, (627), 404 states have internal predecessors, (627), 91 states have call successors, (91), 24 states have call predecessors, (91), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 14:11:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 808 transitions. [2025-03-03 14:11:42,786 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 808 transitions. Word has length 111 [2025-03-03 14:11:42,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:42,786 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 808 transitions. [2025-03-03 14:11:42,786 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-03 14:11:42,786 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 808 transitions. [2025-03-03 14:11:42,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:11:42,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:42,788 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-03 14:11:42,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:11:42,789 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:42,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:42,789 INFO L85 PathProgramCache]: Analyzing trace with hash 707812307, now seen corresponding path program 1 times [2025-03-03 14:11:42,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:42,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025168674] [2025-03-03 14:11:42,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:42,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:42,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:11:42,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:11:42,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:42,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:42,951 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-03 14:11:42,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:42,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025168674] [2025-03-03 14:11:42,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025168674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:42,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:42,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:11:42,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627542869] [2025-03-03 14:11:42,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:42,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:11:42,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:42,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:11:42,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:11:42,953 INFO L87 Difference]: Start difference. First operand 504 states and 808 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-03 14:11:43,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:43,089 INFO L93 Difference]: Finished difference Result 977 states and 1581 transitions. [2025-03-03 14:11:43,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:11:43,090 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-03 14:11:43,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:43,093 INFO L225 Difference]: With dead ends: 977 [2025-03-03 14:11:43,093 INFO L226 Difference]: Without dead ends: 509 [2025-03-03 14:11:43,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:11:43,096 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 21 mSDsluCounter, 6081 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 6845 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-03 14:11:43,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 6845 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-03 14:11:43,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 506. [2025-03-03 14:11:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 391 states have (on average 1.60613810741688) internal successors, (628), 406 states have internal predecessors, (628), 91 states have call successors, (91), 24 states have call predecessors, (91), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 14:11:43,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 809 transitions. [2025-03-03 14:11:43,112 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 809 transitions. Word has length 112 [2025-03-03 14:11:43,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:43,113 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 809 transitions. [2025-03-03 14:11:43,113 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-03 14:11:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 809 transitions. [2025-03-03 14:11:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:11:43,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:43,116 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-03 14:11:43,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:11:43,116 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:43,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:43,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1013219626, now seen corresponding path program 1 times [2025-03-03 14:11:43,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:43,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938588392] [2025-03-03 14:11:43,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:43,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:43,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:11:43,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:11:43,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:43,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:43,208 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-03 14:11:43,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:43,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938588392] [2025-03-03 14:11:43,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938588392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:43,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243984878] [2025-03-03 14:11:43,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:43,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:43,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:43,211 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:43,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:11:43,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:11:43,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:11:43,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:43,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:43,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:11:43,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:43,599 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-03 14:11:43,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:43,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243984878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:43,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:43,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:11:43,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608016719] [2025-03-03 14:11:43,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:43,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:11:43,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:43,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:11:43,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:11:43,600 INFO L87 Difference]: Start difference. First operand 506 states and 809 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-03 14:11:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:44,044 INFO L93 Difference]: Finished difference Result 977 states and 1604 transitions. [2025-03-03 14:11:44,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:11:44,045 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-03 14:11:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:44,048 INFO L225 Difference]: With dead ends: 977 [2025-03-03 14:11:44,048 INFO L226 Difference]: Without dead ends: 514 [2025-03-03 14:11:44,052 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-03 14:11:44,052 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 751 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:44,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1954 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:11:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-03 14:11:44,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2025-03-03 14:11:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 398 states have (on average 1.6080402010050252) internal successors, (640), 413 states have internal predecessors, (640), 91 states have call successors, (91), 25 states have call predecessors, (91), 24 states have return successors, (91), 88 states have call predecessors, (91), 90 states have call successors, (91) [2025-03-03 14:11:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 822 transitions. [2025-03-03 14:11:44,072 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 822 transitions. Word has length 113 [2025-03-03 14:11:44,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:44,073 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 822 transitions. [2025-03-03 14:11:44,073 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-03 14:11:44,073 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 822 transitions. [2025-03-03 14:11:44,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:11:44,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:44,075 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-03 14:11:44,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:11:44,276 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-03 14:11:44,276 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:44,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:44,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1098340228, now seen corresponding path program 1 times [2025-03-03 14:11:44,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:44,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352717816] [2025-03-03 14:11:44,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:44,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:44,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:11:44,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:11:44,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:44,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:44,373 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-03 14:11:44,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:44,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352717816] [2025-03-03 14:11:44,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352717816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:44,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176908015] [2025-03-03 14:11:44,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:44,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:44,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:44,376 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:44,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:11:44,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:11:44,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:11:44,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:44,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:44,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:11:44,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:44,707 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-03 14:11:44,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:44,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176908015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:44,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:44,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:11:44,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136863624] [2025-03-03 14:11:44,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:44,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:11:44,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:44,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:11:44,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:11:44,710 INFO L87 Difference]: Start difference. First operand 514 states and 822 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-03 14:11:45,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:45,109 INFO L93 Difference]: Finished difference Result 993 states and 1627 transitions. [2025-03-03 14:11:45,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:11:45,109 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-03 14:11:45,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:45,113 INFO L225 Difference]: With dead ends: 993 [2025-03-03 14:11:45,113 INFO L226 Difference]: Without dead ends: 522 [2025-03-03 14:11:45,116 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-03 14:11:45,116 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 738 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:45,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1951 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:11:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-03 14:11:45,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-03 14:11:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 405 states have (on average 1.6098765432098765) internal successors, (652), 420 states have internal predecessors, (652), 91 states have call successors, (91), 26 states have call predecessors, (91), 25 states have return successors, (92), 88 states have call predecessors, (92), 90 states have call successors, (92) [2025-03-03 14:11:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 835 transitions. [2025-03-03 14:11:45,133 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 835 transitions. Word has length 116 [2025-03-03 14:11:45,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:45,133 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 835 transitions. [2025-03-03 14:11:45,133 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-03 14:11:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 835 transitions. [2025-03-03 14:11:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:11:45,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:45,135 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-03 14:11:45,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:45,336 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-03 14:11:45,336 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:45,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:45,337 INFO L85 PathProgramCache]: Analyzing trace with hash -133777773, now seen corresponding path program 1 times [2025-03-03 14:11:45,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:45,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488282867] [2025-03-03 14:11:45,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:45,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:45,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:11:45,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:11:45,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:45,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:45,435 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-03 14:11:45,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:45,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488282867] [2025-03-03 14:11:45,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488282867] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:45,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793887097] [2025-03-03 14:11:45,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:45,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:45,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:45,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:45,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:11:45,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:11:45,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:11:45,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:45,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:45,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:11:45,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:45,724 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-03 14:11:45,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:45,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793887097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:45,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:45,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:11:45,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428384740] [2025-03-03 14:11:45,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:45,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:11:45,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:45,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:11:45,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:11:45,728 INFO L87 Difference]: Start difference. First operand 522 states and 835 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-03 14:11:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:46,104 INFO L93 Difference]: Finished difference Result 1009 states and 1650 transitions. [2025-03-03 14:11:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:11:46,104 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-03 14:11:46,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:46,108 INFO L225 Difference]: With dead ends: 1009 [2025-03-03 14:11:46,108 INFO L226 Difference]: Without dead ends: 530 [2025-03-03 14:11:46,110 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-03 14:11:46,111 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 742 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:46,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1948 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:11:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-03 14:11:46,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-03-03 14:11:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 412 states have (on average 1.6116504854368932) internal successors, (664), 427 states have internal predecessors, (664), 91 states have call successors, (91), 27 states have call predecessors, (91), 26 states have return successors, (93), 88 states have call predecessors, (93), 90 states have call successors, (93) [2025-03-03 14:11:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 848 transitions. [2025-03-03 14:11:46,128 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 848 transitions. Word has length 119 [2025-03-03 14:11:46,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:46,128 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 848 transitions. [2025-03-03 14:11:46,128 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-03 14:11:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 848 transitions. [2025-03-03 14:11:46,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:11:46,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:46,131 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-03 14:11:46,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:46,331 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-03 14:11:46,331 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:46,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:46,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1545592755, now seen corresponding path program 1 times [2025-03-03 14:11:46,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:46,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50102312] [2025-03-03 14:11:46,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:46,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:46,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:11:46,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:11:46,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:46,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:46,413 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-03 14:11:46,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:46,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50102312] [2025-03-03 14:11:46,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50102312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:46,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877466279] [2025-03-03 14:11:46,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:46,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:46,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:46,416 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:46,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:11:46,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:11:46,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:11:46,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:46,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:46,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:11:46,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:46,718 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-03 14:11:46,718 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:46,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877466279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:46,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:46,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:11:46,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817094978] [2025-03-03 14:11:46,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:46,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:11:46,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:46,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:11:46,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:11:46,719 INFO L87 Difference]: Start difference. First operand 530 states and 848 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-03 14:11:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:47,071 INFO L93 Difference]: Finished difference Result 1025 states and 1673 transitions. [2025-03-03 14:11:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:11:47,071 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-03 14:11:47,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:47,075 INFO L225 Difference]: With dead ends: 1025 [2025-03-03 14:11:47,075 INFO L226 Difference]: Without dead ends: 538 [2025-03-03 14:11:47,077 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-03 14:11:47,078 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 736 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:47,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1945 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:11:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-03 14:11:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-03-03 14:11:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 419 states have (on average 1.6133651551312649) internal successors, (676), 434 states have internal predecessors, (676), 91 states have call successors, (91), 28 states have call predecessors, (91), 27 states have return successors, (94), 88 states have call predecessors, (94), 90 states have call successors, (94) [2025-03-03 14:11:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 861 transitions. [2025-03-03 14:11:47,093 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 861 transitions. Word has length 122 [2025-03-03 14:11:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:47,093 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 861 transitions. [2025-03-03 14:11:47,094 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-03 14:11:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 861 transitions. [2025-03-03 14:11:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:11:47,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:47,096 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-03 14:11:47,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:47,299 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-03 14:11:47,299 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:47,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:47,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1558451402, now seen corresponding path program 1 times [2025-03-03 14:11:47,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:47,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967533830] [2025-03-03 14:11:47,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:47,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:47,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:11:47,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:11:47,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:47,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:47,381 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-03 14:11:47,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:47,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967533830] [2025-03-03 14:11:47,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967533830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:47,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343971736] [2025-03-03 14:11:47,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:47,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:47,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:47,385 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:47,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:11:47,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:11:47,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:11:47,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:47,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:47,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:11:47,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:47,660 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-03 14:11:47,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:47,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343971736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:47,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:47,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-03 14:11:47,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74213458] [2025-03-03 14:11:47,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:47,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:11:47,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:47,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:11:47,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:11:47,661 INFO L87 Difference]: Start difference. First operand 538 states and 861 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-03 14:11:48,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:48,017 INFO L93 Difference]: Finished difference Result 1035 states and 1700 transitions. [2025-03-03 14:11:48,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:11:48,018 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-03 14:11:48,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:48,025 INFO L225 Difference]: With dead ends: 1035 [2025-03-03 14:11:48,025 INFO L226 Difference]: Without dead ends: 540 [2025-03-03 14:11:48,028 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-03 14:11:48,028 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 716 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:48,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1945 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:11:48,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-03 14:11:48,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-03-03 14:11:48,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 420 states have (on average 1.6023809523809525) internal successors, (673), 436 states have internal predecessors, (673), 91 states have call successors, (91), 28 states have call predecessors, (91), 28 states have return successors, (95), 88 states have call predecessors, (95), 90 states have call successors, (95) [2025-03-03 14:11:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 859 transitions. [2025-03-03 14:11:48,071 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 859 transitions. Word has length 125 [2025-03-03 14:11:48,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:48,071 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 859 transitions. [2025-03-03 14:11:48,071 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-03 14:11:48,071 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 859 transitions. [2025-03-03 14:11:48,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:11:48,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:48,073 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-03 14:11:48,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:48,278 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-03 14:11:48,278 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:48,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:48,278 INFO L85 PathProgramCache]: Analyzing trace with hash 934550480, now seen corresponding path program 1 times [2025-03-03 14:11:48,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:48,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703911866] [2025-03-03 14:11:48,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:48,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:48,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:11:48,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:11:48,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:48,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:48,483 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-03 14:11:48,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:48,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703911866] [2025-03-03 14:11:48,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703911866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:48,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012646218] [2025-03-03 14:11:48,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:48,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:48,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:48,486 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:48,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:11:48,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:11:48,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:11:48,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:48,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:48,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 1220 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:11:48,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:48,821 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-03 14:11:48,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:48,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012646218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:48,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:48,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2025-03-03 14:11:48,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121797681] [2025-03-03 14:11:48,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:48,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:11:48,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:48,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:11:48,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:11:48,823 INFO L87 Difference]: Start difference. First operand 540 states and 859 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-03 14:11:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:49,239 INFO L93 Difference]: Finished difference Result 1532 states and 2502 transitions. [2025-03-03 14:11:49,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:11:49,240 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-03 14:11:49,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:49,245 INFO L225 Difference]: With dead ends: 1532 [2025-03-03 14:11:49,245 INFO L226 Difference]: Without dead ends: 1035 [2025-03-03 14:11:49,248 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-03 14:11:49,248 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 700 mSDsluCounter, 2632 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 3455 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:49,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 3455 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:11:49,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2025-03-03 14:11:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1028. [2025-03-03 14:11:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 799 states have (on average 1.620775969962453) internal successors, (1295), 830 states have internal predecessors, (1295), 174 states have call successors, (174), 52 states have call predecessors, (174), 54 states have return successors, (195), 171 states have call predecessors, (195), 172 states have call successors, (195) [2025-03-03 14:11:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1664 transitions. [2025-03-03 14:11:49,294 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1664 transitions. Word has length 125 [2025-03-03 14:11:49,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:49,294 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1664 transitions. [2025-03-03 14:11:49,294 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-03 14:11:49,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1664 transitions. [2025-03-03 14:11:49,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:11:49,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:49,297 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-03 14:11:49,304 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-03 14:11:49,497 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-03 14:11:49,498 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:49,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:49,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1960651274, now seen corresponding path program 1 times [2025-03-03 14:11:49,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:49,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566211099] [2025-03-03 14:11:49,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:49,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:49,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:11:49,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:11:49,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:49,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:49,694 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-03 14:11:49,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:49,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566211099] [2025-03-03 14:11:49,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566211099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:49,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999973711] [2025-03-03 14:11:49,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:49,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:49,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:49,697 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:49,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:11:49,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:11:49,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:11:49,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:49,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:49,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 14:11:49,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:50,001 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-03 14:11:50,003 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:50,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999973711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:50,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:50,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-03 14:11:50,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968633944] [2025-03-03 14:11:50,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:50,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:11:50,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:50,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:11:50,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:11:50,004 INFO L87 Difference]: Start difference. First operand 1028 states and 1664 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-03 14:11:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:50,307 INFO L93 Difference]: Finished difference Result 2031 states and 3335 transitions. [2025-03-03 14:11:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:11:50,308 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-03 14:11:50,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:50,314 INFO L225 Difference]: With dead ends: 2031 [2025-03-03 14:11:50,314 INFO L226 Difference]: Without dead ends: 1046 [2025-03-03 14:11:50,318 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-03 14:11:50,319 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 719 mSDsluCounter, 2210 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 3041 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:50,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 3041 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:11:50,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-03-03 14:11:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1038. [2025-03-03 14:11:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 805 states have (on average 1.6161490683229813) internal successors, (1301), 839 states have internal predecessors, (1301), 176 states have call successors, (176), 53 states have call predecessors, (176), 56 states have return successors, (205), 171 states have call predecessors, (205), 174 states have call successors, (205) [2025-03-03 14:11:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1682 transitions. [2025-03-03 14:11:50,356 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1682 transitions. Word has length 127 [2025-03-03 14:11:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:50,356 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1682 transitions. [2025-03-03 14:11:50,356 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-03 14:11:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1682 transitions. [2025-03-03 14:11:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:11:50,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:50,358 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-03 14:11:50,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 14:11:50,559 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-03 14:11:50,560 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:50,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash -996217341, now seen corresponding path program 1 times [2025-03-03 14:11:50,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:50,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126466302] [2025-03-03 14:11:50,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:50,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:50,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:11:50,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:11:50,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:50,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:50,737 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-03 14:11:50,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:50,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126466302] [2025-03-03 14:11:50,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126466302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:50,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225703322] [2025-03-03 14:11:50,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:50,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:50,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:50,740 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:50,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:11:50,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:11:50,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:11:50,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:50,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:50,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:11:50,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:50,950 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-03 14:11:50,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:50,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225703322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:50,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:50,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:11:50,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326279864] [2025-03-03 14:11:50,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:50,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:11:50,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:50,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:11:50,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:11:50,951 INFO L87 Difference]: Start difference. First operand 1038 states and 1682 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-03 14:11:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:51,013 INFO L93 Difference]: Finished difference Result 2521 states and 4154 transitions. [2025-03-03 14:11:51,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:11:51,014 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-03 14:11:51,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:51,021 INFO L225 Difference]: With dead ends: 2521 [2025-03-03 14:11:51,021 INFO L226 Difference]: Without dead ends: 1527 [2025-03-03 14:11:51,026 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-03 14:11:51,030 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 748 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 2291 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-03 14:11:51,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 2291 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:51,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-03-03 14:11:51,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1038. [2025-03-03 14:11:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 805 states have (on average 1.6149068322981366) internal successors, (1300), 839 states have internal predecessors, (1300), 176 states have call successors, (176), 53 states have call predecessors, (176), 56 states have return successors, (205), 171 states have call predecessors, (205), 174 states have call successors, (205) [2025-03-03 14:11:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1681 transitions. [2025-03-03 14:11:51,073 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1681 transitions. Word has length 132 [2025-03-03 14:11:51,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:51,073 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1681 transitions. [2025-03-03 14:11:51,073 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-03 14:11:51,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1681 transitions. [2025-03-03 14:11:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:11:51,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:51,076 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-03 14:11:51,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 14:11:51,281 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-03 14:11:51,281 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:51,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:51,282 INFO L85 PathProgramCache]: Analyzing trace with hash -645417404, now seen corresponding path program 1 times [2025-03-03 14:11:51,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:51,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162822855] [2025-03-03 14:11:51,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:51,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:51,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:11:51,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:11:51,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:51,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:51,455 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-03 14:11:51,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:51,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162822855] [2025-03-03 14:11:51,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162822855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:51,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418909306] [2025-03-03 14:11:51,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:51,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:51,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:51,457 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:51,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:11:51,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:11:51,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:11:51,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:51,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:51,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:11:51,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:51,716 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-03 14:11:51,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:51,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418909306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:51,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:51,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-03 14:11:51,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437071360] [2025-03-03 14:11:51,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:51,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:11:51,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:51,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:11:51,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:11:51,718 INFO L87 Difference]: Start difference. First operand 1038 states and 1681 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-03 14:11:51,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:51,787 INFO L93 Difference]: Finished difference Result 2608 states and 4244 transitions. [2025-03-03 14:11:51,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:11:51,787 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-03 14:11:51,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:51,795 INFO L225 Difference]: With dead ends: 2608 [2025-03-03 14:11:51,795 INFO L226 Difference]: Without dead ends: 1615 [2025-03-03 14:11:51,799 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-03 14:11:51,800 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 344 mSDsluCounter, 2513 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 3377 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-03 14:11:51,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 3377 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:51,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2025-03-03 14:11:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1615. [2025-03-03 14:11:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1259 states have (on average 1.5861795075456713) internal successors, (1997), 1300 states have internal predecessors, (1997), 260 states have call successors, (260), 89 states have call predecessors, (260), 95 states have return successors, (343), 251 states have call predecessors, (343), 256 states have call successors, (343) [2025-03-03 14:11:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2600 transitions. [2025-03-03 14:11:51,861 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2600 transitions. Word has length 132 [2025-03-03 14:11:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:51,861 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2600 transitions. [2025-03-03 14:11:51,861 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-03 14:11:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2600 transitions. [2025-03-03 14:11:51,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:11:51,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:51,864 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-03 14:11:51,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:52,065 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-03 14:11:52,065 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:52,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:52,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1253494267, now seen corresponding path program 1 times [2025-03-03 14:11:52,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:52,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564454226] [2025-03-03 14:11:52,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:52,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:52,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:11:52,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:11:52,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:52,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:52,236 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-03 14:11:52,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:52,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564454226] [2025-03-03 14:11:52,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564454226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:52,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425171195] [2025-03-03 14:11:52,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:52,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:52,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:52,238 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:52,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 14:11:52,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:11:52,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:11:52,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:52,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:52,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 1229 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:11:52,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:52,508 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-03 14:11:52,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:52,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425171195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:52,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:52,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2025-03-03 14:11:52,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939055007] [2025-03-03 14:11:52,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:52,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:11:52,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:52,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:11:52,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:11:52,509 INFO L87 Difference]: Start difference. First operand 1615 states and 2600 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-03 14:11:52,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:52,555 INFO L93 Difference]: Finished difference Result 2935 states and 4715 transitions. [2025-03-03 14:11:52,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:11:52,556 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-03 14:11:52,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:52,563 INFO L225 Difference]: With dead ends: 2935 [2025-03-03 14:11:52,563 INFO L226 Difference]: Without dead ends: 1365 [2025-03-03 14:11:52,569 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-03 14:11:52,570 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 510 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1284 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-03 14:11:52,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1284 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:11:52,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2025-03-03 14:11:52,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1365. [2025-03-03 14:11:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1061 states have (on average 1.5645617342130067) internal successors, (1660), 1093 states have internal predecessors, (1660), 219 states have call successors, (219), 81 states have call predecessors, (219), 84 states have return successors, (279), 214 states have call predecessors, (279), 215 states have call successors, (279) [2025-03-03 14:11:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2158 transitions. [2025-03-03 14:11:52,616 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2158 transitions. Word has length 132 [2025-03-03 14:11:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:52,616 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 2158 transitions. [2025-03-03 14:11:52,617 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-03 14:11:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2158 transitions. [2025-03-03 14:11:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 14:11:52,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:52,620 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-03 14:11:52,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 14:11:52,820 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-03 14:11:52,821 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:52,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:52,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1681644658, now seen corresponding path program 1 times [2025-03-03 14:11:52,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:52,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998125861] [2025-03-03 14:11:52,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:52,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:52,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 14:11:52,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 14:11:52,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:52,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:53,008 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-03 14:11:53,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:53,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998125861] [2025-03-03 14:11:53,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998125861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:53,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075129934] [2025-03-03 14:11:53,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:53,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:53,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:53,011 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:53,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 14:11:53,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 14:11:53,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 14:11:53,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:53,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:53,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 1324 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:11:53,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:53,255 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-03 14:11:53,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:53,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075129934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:53,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:53,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-03 14:11:53,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5172450] [2025-03-03 14:11:53,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:53,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:53,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:53,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:53,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:11:53,256 INFO L87 Difference]: Start difference. First operand 1365 states and 2158 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-03 14:11:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:53,417 INFO L93 Difference]: Finished difference Result 2775 states and 4448 transitions. [2025-03-03 14:11:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:11:53,417 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-03 14:11:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:53,427 INFO L225 Difference]: With dead ends: 2775 [2025-03-03 14:11:53,427 INFO L226 Difference]: Without dead ends: 1455 [2025-03-03 14:11:53,433 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-03 14:11:53,434 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 144 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2161 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-03 14:11:53,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2161 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2025-03-03 14:11:53,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1443. [2025-03-03 14:11:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1137 states have (on average 1.5883905013192612) internal successors, (1806), 1169 states have internal predecessors, (1806), 219 states have call successors, (219), 83 states have call predecessors, (219), 86 states have return successors, (279), 214 states have call predecessors, (279), 215 states have call successors, (279) [2025-03-03 14:11:53,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2304 transitions. [2025-03-03 14:11:53,477 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2304 transitions. Word has length 155 [2025-03-03 14:11:53,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:53,478 INFO L471 AbstractCegarLoop]: Abstraction has 1443 states and 2304 transitions. [2025-03-03 14:11:53,478 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-03 14:11:53,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2304 transitions. [2025-03-03 14:11:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 14:11:53,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:53,482 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-03 14:11:53,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 14:11:53,682 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-03 14:11:53,682 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:53,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:53,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1238846729, now seen corresponding path program 1 times [2025-03-03 14:11:53,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:53,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203788301] [2025-03-03 14:11:53,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:53,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:53,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 14:11:53,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 14:11:53,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:53,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:53,857 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-03 14:11:53,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:53,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203788301] [2025-03-03 14:11:53,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203788301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:53,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7969879] [2025-03-03 14:11:53,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:53,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:53,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:53,860 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:53,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 14:11:53,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 14:11:54,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 14:11:54,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:54,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:54,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:11:54,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:54,095 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-03 14:11:54,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:54,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7969879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:54,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:54,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-03 14:11:54,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266195923] [2025-03-03 14:11:54,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:54,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:54,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:54,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:54,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:11:54,097 INFO L87 Difference]: Start difference. First operand 1443 states and 2304 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-03 14:11:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:54,259 INFO L93 Difference]: Finished difference Result 2937 states and 4742 transitions. [2025-03-03 14:11:54,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:11:54,260 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-03 14:11:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:54,268 INFO L225 Difference]: With dead ends: 2937 [2025-03-03 14:11:54,268 INFO L226 Difference]: Without dead ends: 1539 [2025-03-03 14:11:54,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 164 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-03 14:11:54,273 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 142 mSDsluCounter, 1431 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 2158 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-03 14:11:54,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 2158 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:54,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2025-03-03 14:11:54,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1521. [2025-03-03 14:11:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1213 states have (on average 1.6092333058532564) internal successors, (1952), 1245 states have internal predecessors, (1952), 219 states have call successors, (219), 85 states have call predecessors, (219), 88 states have return successors, (279), 214 states have call predecessors, (279), 215 states have call successors, (279) [2025-03-03 14:11:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2450 transitions. [2025-03-03 14:11:54,314 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2450 transitions. Word has length 160 [2025-03-03 14:11:54,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:54,314 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 2450 transitions. [2025-03-03 14:11:54,315 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-03 14:11:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2450 transitions. [2025-03-03 14:11:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 14:11:54,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:54,319 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-03 14:11:54,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:54,519 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-03 14:11:54,520 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:54,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:54,522 INFO L85 PathProgramCache]: Analyzing trace with hash 488027351, now seen corresponding path program 1 times [2025-03-03 14:11:54,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:54,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561060839] [2025-03-03 14:11:54,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:54,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 14:11:54,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 14:11:54,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:54,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:54,661 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-03 14:11:54,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:54,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561060839] [2025-03-03 14:11:54,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561060839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:54,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924956456] [2025-03-03 14:11:54,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:54,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:54,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:54,664 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:54,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 14:11:54,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 14:11:54,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 14:11:54,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:54,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:54,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:11:54,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:54,891 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-03 14:11:54,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:54,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924956456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:54,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:54,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-03 14:11:54,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381187531] [2025-03-03 14:11:54,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:54,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:54,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:54,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:54,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:11:54,893 INFO L87 Difference]: Start difference. First operand 1521 states and 2450 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-03 14:11:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:55,067 INFO L93 Difference]: Finished difference Result 3099 states and 5036 transitions. [2025-03-03 14:11:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:11:55,068 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-03 14:11:55,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:55,077 INFO L225 Difference]: With dead ends: 3099 [2025-03-03 14:11:55,078 INFO L226 Difference]: Without dead ends: 1623 [2025-03-03 14:11:55,082 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-03 14:11:55,082 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 140 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 2155 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-03 14:11:55,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 2155 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:55,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2025-03-03 14:11:55,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1599. [2025-03-03 14:11:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1289 states have (on average 1.6276183087664857) internal successors, (2098), 1321 states have internal predecessors, (2098), 219 states have call successors, (219), 87 states have call predecessors, (219), 90 states have return successors, (279), 214 states have call predecessors, (279), 215 states have call successors, (279) [2025-03-03 14:11:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2596 transitions. [2025-03-03 14:11:55,127 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2596 transitions. Word has length 164 [2025-03-03 14:11:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:55,128 INFO L471 AbstractCegarLoop]: Abstraction has 1599 states and 2596 transitions. [2025-03-03 14:11:55,128 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-03 14:11:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2596 transitions. [2025-03-03 14:11:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 14:11:55,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:55,130 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-03 14:11:55,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 14:11:55,331 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-03 14:11:55,331 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:55,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:55,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1467720176, now seen corresponding path program 1 times [2025-03-03 14:11:55,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:55,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562947263] [2025-03-03 14:11:55,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:55,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:55,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 14:11:55,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 14:11:55,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:55,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:55,465 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-03 14:11:55,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:55,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562947263] [2025-03-03 14:11:55,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562947263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:55,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376112474] [2025-03-03 14:11:55,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:55,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:55,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:55,467 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:55,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 14:11:55,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 14:11:55,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 14:11:55,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:55,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:55,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:11:55,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:55,691 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-03 14:11:55,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:55,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376112474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:55,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:55,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-03 14:11:55,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054079935] [2025-03-03 14:11:55,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:55,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:11:55,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:55,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:11:55,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:11:55,692 INFO L87 Difference]: Start difference. First operand 1599 states and 2596 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-03 14:11:55,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:55,843 INFO L93 Difference]: Finished difference Result 3261 states and 5330 transitions. [2025-03-03 14:11:55,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:11:55,844 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-03 14:11:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:55,853 INFO L225 Difference]: With dead ends: 3261 [2025-03-03 14:11:55,853 INFO L226 Difference]: Without dead ends: 1707 [2025-03-03 14:11:55,856 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-03 14:11:55,857 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 138 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 2145 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-03 14:11:55,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 2145 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2025-03-03 14:11:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1677. [2025-03-03 14:11:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1365 states have (on average 1.6439560439560439) internal successors, (2244), 1397 states have internal predecessors, (2244), 219 states have call successors, (219), 89 states have call predecessors, (219), 92 states have return successors, (279), 214 states have call predecessors, (279), 215 states have call successors, (279) [2025-03-03 14:11:55,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2742 transitions. [2025-03-03 14:11:55,898 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2742 transitions. Word has length 167 [2025-03-03 14:11:55,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:55,898 INFO L471 AbstractCegarLoop]: Abstraction has 1677 states and 2742 transitions. [2025-03-03 14:11:55,899 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-03 14:11:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2742 transitions. [2025-03-03 14:11:55,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 14:11:55,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:55,901 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:11:55,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:56,102 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-03 14:11:56,102 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:56,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash 822549346, now seen corresponding path program 1 times [2025-03-03 14:11:56,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:56,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557287569] [2025-03-03 14:11:56,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:56,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:56,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 14:11:56,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 14:11:56,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:56,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:56,250 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-03 14:11:56,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:56,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557287569] [2025-03-03 14:11:56,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557287569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:56,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323086246] [2025-03-03 14:11:56,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:56,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:56,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:56,253 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:56,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 14:11:56,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 14:11:56,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 14:11:56,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:56,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:56,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 14:11:56,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:11:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-03-03 14:11:56,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:11:56,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323086246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:56,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:11:56,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-03-03 14:11:56,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289349049] [2025-03-03 14:11:56,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:56,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:11:56,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:56,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:11:56,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:11:56,659 INFO L87 Difference]: Start difference. First operand 1677 states and 2742 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 7 states have internal predecessors, (108), 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-03 14:11:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:58,571 INFO L93 Difference]: Finished difference Result 5230 states and 8701 transitions. [2025-03-03 14:11:58,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:11:58,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 7 states have internal predecessors, (108), 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-03 14:11:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:58,597 INFO L225 Difference]: With dead ends: 5230 [2025-03-03 14:11:58,597 INFO L226 Difference]: Without dead ends: 3222 [2025-03-03 14:11:58,606 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-03 14:11:58,606 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 1793 mSDsluCounter, 1857 mSDsCounter, 0 mSdLazyCounter, 3586 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1890 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 4022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 3586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:11:58,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1890 Valid, 2211 Invalid, 4022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 3586 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:11:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3222 states. [2025-03-03 14:11:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3222 to 3206. [2025-03-03 14:11:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3206 states, 2565 states have (on average 1.649512670565302) internal successors, (4231), 2653 states have internal predecessors, (4231), 455 states have call successors, (455), 159 states have call predecessors, (455), 185 states have return successors, (605), 451 states have call predecessors, (605), 451 states have call successors, (605) [2025-03-03 14:11:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3206 states to 3206 states and 5291 transitions. [2025-03-03 14:11:58,709 INFO L78 Accepts]: Start accepts. Automaton has 3206 states and 5291 transitions. Word has length 169 [2025-03-03 14:11:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:58,710 INFO L471 AbstractCegarLoop]: Abstraction has 3206 states and 5291 transitions. [2025-03-03 14:11:58,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 7 states have internal predecessors, (108), 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-03 14:11:58,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 5291 transitions. [2025-03-03 14:11:58,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 14:11:58,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:58,717 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:11:58,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 14:11:58,917 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-03 14:11:58,917 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:58,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:58,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1484622757, now seen corresponding path program 1 times [2025-03-03 14:11:58,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:58,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690343475] [2025-03-03 14:11:58,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:58,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:58,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 14:11:58,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 14:11:58,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:58,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-03 14:11:59,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:59,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690343475] [2025-03-03 14:11:59,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690343475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:11:59,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:11:59,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:11:59,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123316312] [2025-03-03 14:11:59,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:11:59,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:11:59,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:11:59,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:11:59,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:11:59,036 INFO L87 Difference]: Start difference. First operand 3206 states and 5291 transitions. Second operand has 8 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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-03 14:11:59,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:11:59,186 INFO L93 Difference]: Finished difference Result 6238 states and 10322 transitions. [2025-03-03 14:11:59,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:11:59,187 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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-03 14:11:59,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:11:59,204 INFO L225 Difference]: With dead ends: 6238 [2025-03-03 14:11:59,204 INFO L226 Difference]: Without dead ends: 2939 [2025-03-03 14:11:59,214 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-03 14:11:59,215 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 30 mSDsluCounter, 4560 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 5325 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-03 14:11:59,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 5325 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:11:59,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2025-03-03 14:11:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2927. [2025-03-03 14:11:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2386 states have (on average 1.6705783738474433) internal successors, (3986), 2461 states have internal predecessors, (3986), 375 states have call successors, (375), 147 states have call predecessors, (375), 165 states have return successors, (475), 366 states have call predecessors, (475), 371 states have call successors, (475) [2025-03-03 14:11:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 4836 transitions. [2025-03-03 14:11:59,291 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 4836 transitions. Word has length 172 [2025-03-03 14:11:59,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:11:59,291 INFO L471 AbstractCegarLoop]: Abstraction has 2927 states and 4836 transitions. [2025-03-03 14:11:59,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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-03 14:11:59,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 4836 transitions. [2025-03-03 14:11:59,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-03 14:11:59,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:11:59,300 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 7, 7, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:11:59,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 14:11:59,301 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:11:59,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:11:59,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1206503126, now seen corresponding path program 1 times [2025-03-03 14:11:59,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:11:59,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272605598] [2025-03-03 14:11:59,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:59,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:11:59,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-03 14:11:59,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-03 14:11:59,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:11:59,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:11:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 36 proven. 101 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 14:11:59,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:11:59,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272605598] [2025-03-03 14:11:59,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272605598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:11:59,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973891754] [2025-03-03 14:11:59,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:11:59,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:11:59,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:11:59,642 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:11:59,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 14:11:59,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-03 14:12:00,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-03 14:12:00,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:12:00,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:12:00,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 3161 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:12:00,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:12:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 343 proven. 50 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2025-03-03 14:12:00,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:12:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 57 proven. 93 refuted. 0 times theorem prover too weak. 911 trivial. 0 not checked. [2025-03-03 14:12:00,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973891754] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:12:00,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:12:00,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 14] total 27 [2025-03-03 14:12:00,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398292245] [2025-03-03 14:12:00,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:12:00,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 14:12:00,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:12:00,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 14:12:00,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:12:00,985 INFO L87 Difference]: Start difference. First operand 2927 states and 4836 transitions. Second operand has 27 states, 25 states have (on average 14.56) internal successors, (364), 23 states have internal predecessors, (364), 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-03 14:12:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:12:32,089 INFO L93 Difference]: Finished difference Result 32696 states and 55640 transitions. [2025-03-03 14:12:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 352 states. [2025-03-03 14:12:32,091 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 14.56) internal successors, (364), 23 states have internal predecessors, (364), 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-03 14:12:32,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:12:32,265 INFO L225 Difference]: With dead ends: 32696 [2025-03-03 14:12:32,265 INFO L226 Difference]: Without dead ends: 29451 [2025-03-03 14:12:32,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1377 GetRequests, 1005 SyntacticMatches, 4 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61016 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=10952, Invalid=125578, Unknown=0, NotChecked=0, Total=136530 [2025-03-03 14:12:32,325 INFO L435 NwaCegarLoop]: 2464 mSDtfsCounter, 32525 mSDsluCounter, 22377 mSDsCounter, 0 mSdLazyCounter, 70933 mSolverCounterSat, 11757 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32525 SdHoareTripleChecker+Valid, 24841 SdHoareTripleChecker+Invalid, 82690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 11757 IncrementalHoareTripleChecker+Valid, 70933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:12:32,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32525 Valid, 24841 Invalid, 82690 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [11757 Valid, 70933 Invalid, 0 Unknown, 0 Unchecked, 23.7s Time] [2025-03-03 14:12:32,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29451 states. [2025-03-03 14:12:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29451 to 24199. [2025-03-03 14:12:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24199 states, 19802 states have (on average 1.6433693566306433) internal successors, (32542), 20387 states have internal predecessors, (32542), 2941 states have call successors, (2941), 1326 states have call predecessors, (2941), 1455 states have return successors, (4134), 2905 states have call predecessors, (4134), 2923 states have call successors, (4134) [2025-03-03 14:12:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24199 states to 24199 states and 39617 transitions. [2025-03-03 14:12:33,380 INFO L78 Accepts]: Start accepts. Automaton has 24199 states and 39617 transitions. Word has length 460 [2025-03-03 14:12:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:12:33,380 INFO L471 AbstractCegarLoop]: Abstraction has 24199 states and 39617 transitions. [2025-03-03 14:12:33,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 14.56) internal successors, (364), 23 states have internal predecessors, (364), 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-03 14:12:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 24199 states and 39617 transitions. [2025-03-03 14:12:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-03-03 14:12:33,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:12:33,449 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 6, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:12:33,459 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-03 14:12:33,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:12:33,650 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:12:33,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:12:33,651 INFO L85 PathProgramCache]: Analyzing trace with hash -954183172, now seen corresponding path program 1 times [2025-03-03 14:12:33,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:12:33,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384887008] [2025-03-03 14:12:33,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:12:33,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:12:33,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-03-03 14:12:33,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-03-03 14:12:33,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:12:33,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:12:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 61 proven. 70 refuted. 0 times theorem prover too weak. 1117 trivial. 0 not checked. [2025-03-03 14:12:34,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:12:34,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384887008] [2025-03-03 14:12:34,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384887008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:12:34,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922580690] [2025-03-03 14:12:34,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:12:34,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:12:34,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:12:34,083 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:12:34,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 14:12:34,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-03-03 14:12:34,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-03-03 14:12:34,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:12:34,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:12:34,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:12:34,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:12:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 618 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-03 14:12:34,629 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:12:34,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922580690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:12:34,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:12:34,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:12:34,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059962449] [2025-03-03 14:12:34,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:12:34,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:12:34,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:12:34,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:12:34,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:12:34,631 INFO L87 Difference]: Start difference. First operand 24199 states and 39617 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-03 14:12:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:12:35,778 INFO L93 Difference]: Finished difference Result 46238 states and 75975 transitions. [2025-03-03 14:12:35,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:12:35,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-03 14:12:35,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:12:35,908 INFO L225 Difference]: With dead ends: 46238 [2025-03-03 14:12:35,908 INFO L226 Difference]: Without dead ends: 26576 [2025-03-03 14:12:35,990 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-03 14:12:35,991 INFO L435 NwaCegarLoop]: 1395 mSDtfsCounter, 681 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 2085 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-03 14:12:35,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 2085 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:12:36,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26576 states. [2025-03-03 14:12:36,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26576 to 26563. [2025-03-03 14:12:36,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26563 states, 21734 states have (on average 1.6402871077574308) internal successors, (35650), 22372 states have internal predecessors, (35650), 3227 states have call successors, (3227), 1465 states have call predecessors, (3227), 1601 states have return successors, (4602), 3181 states have call predecessors, (4602), 3207 states have call successors, (4602) [2025-03-03 14:12:37,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26563 states to 26563 states and 43479 transitions. [2025-03-03 14:12:37,031 INFO L78 Accepts]: Start accepts. Automaton has 26563 states and 43479 transitions. Word has length 523 [2025-03-03 14:12:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:12:37,032 INFO L471 AbstractCegarLoop]: Abstraction has 26563 states and 43479 transitions. [2025-03-03 14:12:37,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-03 14:12:37,032 INFO L276 IsEmpty]: Start isEmpty. Operand 26563 states and 43479 transitions. [2025-03-03 14:12:37,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-03-03 14:12:37,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:12:37,113 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 6, 4, 4, 4, 4, 4, 4, 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, 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-03 14:12:37,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-03 14:12:37,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:12:37,321 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:12:37,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:12:37,321 INFO L85 PathProgramCache]: Analyzing trace with hash 524665919, now seen corresponding path program 1 times [2025-03-03 14:12:37,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:12:37,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63176268] [2025-03-03 14:12:37,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:12:37,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:12:37,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-03-03 14:12:37,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-03-03 14:12:37,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:12:37,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:12:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 61 proven. 70 refuted. 0 times theorem prover too weak. 1101 trivial. 0 not checked. [2025-03-03 14:12:37,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:12:37,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63176268] [2025-03-03 14:12:37,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63176268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:12:37,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306317112] [2025-03-03 14:12:37,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:12:37,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:12:37,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:12:37,691 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:12:37,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 14:12:37,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-03-03 14:12:38,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-03-03 14:12:38,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:12:38,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:12:38,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 3306 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:12:38,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:12:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-03-03 14:12:38,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:12:38,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306317112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:12:38,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:12:38,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-03 14:12:38,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512930956] [2025-03-03 14:12:38,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:12:38,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:12:38,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:12:38,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:12:38,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:12:38,166 INFO L87 Difference]: Start difference. First operand 26563 states and 43479 transitions. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 5 states have internal predecessors, (226), 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-03 14:12:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:12:39,581 INFO L93 Difference]: Finished difference Result 53318 states and 87499 transitions. [2025-03-03 14:12:39,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:12:39,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 5 states have internal predecessors, (226), 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 507 [2025-03-03 14:12:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:12:39,751 INFO L225 Difference]: With dead ends: 53318 [2025-03-03 14:12:39,751 INFO L226 Difference]: Without dead ends: 26824 [2025-03-03 14:12:39,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:12:39,892 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 0 mSDsluCounter, 3111 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3891 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-03 14:12:39,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3891 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:12:39,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26824 states. [2025-03-03 14:12:41,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26824 to 26717. [2025-03-03 14:12:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26717 states, 21847 states have (on average 1.636975328420378) internal successors, (35763), 22502 states have internal predecessors, (35763), 3227 states have call successors, (3227), 1465 states have call predecessors, (3227), 1642 states have return successors, (4650), 3205 states have call predecessors, (4650), 3207 states have call successors, (4650) [2025-03-03 14:12:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26717 states to 26717 states and 43640 transitions. [2025-03-03 14:12:41,157 INFO L78 Accepts]: Start accepts. Automaton has 26717 states and 43640 transitions. Word has length 507 [2025-03-03 14:12:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:12:41,157 INFO L471 AbstractCegarLoop]: Abstraction has 26717 states and 43640 transitions. [2025-03-03 14:12:41,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 5 states have internal predecessors, (226), 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-03 14:12:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand 26717 states and 43640 transitions. [2025-03-03 14:12:41,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-03 14:12:41,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:12:41,231 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 6, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:12:41,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-03 14:12:41,432 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-03 14:12:41,432 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:12:41,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:12:41,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1290064027, now seen corresponding path program 1 times [2025-03-03 14:12:41,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:12:41,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260408141] [2025-03-03 14:12:41,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:12:41,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:12:41,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-03 14:12:41,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-03 14:12:41,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:12:41,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:12:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 61 proven. 70 refuted. 0 times theorem prover too weak. 1101 trivial. 0 not checked. [2025-03-03 14:12:41,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:12:41,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260408141] [2025-03-03 14:12:41,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260408141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:12:41,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485956067] [2025-03-03 14:12:41,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:12:41,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:12:41,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:12:41,752 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:12:41,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 14:12:41,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-03 14:12:42,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-03 14:12:42,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:12:42,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:12:42,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 3344 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:12:42,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:12:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 743 proven. 3 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-03 14:12:42,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:12:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 117 proven. 12 refuted. 0 times theorem prover too weak. 1103 trivial. 0 not checked. [2025-03-03 14:12:42,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485956067] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:12:42,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:12:42,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 6] total 15 [2025-03-03 14:12:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153451211] [2025-03-03 14:12:42,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:12:42,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 14:12:42,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:12:42,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 14:12:42,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:12:42,548 INFO L87 Difference]: Start difference. First operand 26717 states and 43640 transitions. Second operand has 15 states, 15 states have (on average 23.666666666666668) internal successors, (355), 14 states have internal predecessors, (355), 6 states have call successors, (78), 4 states have call predecessors, (78), 10 states have return successors, (80), 7 states have call predecessors, (80), 6 states have call successors, (80) [2025-03-03 14:12:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:12:47,508 INFO L93 Difference]: Finished difference Result 72201 states and 118774 transitions. [2025-03-03 14:12:47,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 14:12:47,508 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 23.666666666666668) internal successors, (355), 14 states have internal predecessors, (355), 6 states have call successors, (78), 4 states have call predecessors, (78), 10 states have return successors, (80), 7 states have call predecessors, (80), 6 states have call successors, (80) Word has length 518 [2025-03-03 14:12:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:12:47,718 INFO L225 Difference]: With dead ends: 72201 [2025-03-03 14:12:47,718 INFO L226 Difference]: Without dead ends: 45723 [2025-03-03 14:12:47,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1087 GetRequests, 1048 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=299, Invalid=1341, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 14:12:47,857 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 3204 mSDsluCounter, 5045 mSDsCounter, 0 mSdLazyCounter, 9237 mSolverCounterSat, 1101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3204 SdHoareTripleChecker+Valid, 5736 SdHoareTripleChecker+Invalid, 10338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1101 IncrementalHoareTripleChecker+Valid, 9237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:12:47,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3204 Valid, 5736 Invalid, 10338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1101 Valid, 9237 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 14:12:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45723 states. [2025-03-03 14:12:49,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45723 to 44941. [2025-03-03 14:12:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44941 states, 36711 states have (on average 1.6343602734875105) internal successors, (59999), 37836 states have internal predecessors, (59999), 5379 states have call successors, (5379), 2495 states have call predecessors, (5379), 2850 states have return successors, (8179), 5401 states have call predecessors, (8179), 5348 states have call successors, (8179) [2025-03-03 14:12:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44941 states to 44941 states and 73557 transitions. [2025-03-03 14:12:50,283 INFO L78 Accepts]: Start accepts. Automaton has 44941 states and 73557 transitions. Word has length 518 [2025-03-03 14:12:50,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:12:50,283 INFO L471 AbstractCegarLoop]: Abstraction has 44941 states and 73557 transitions. [2025-03-03 14:12:50,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 23.666666666666668) internal successors, (355), 14 states have internal predecessors, (355), 6 states have call successors, (78), 4 states have call predecessors, (78), 10 states have return successors, (80), 7 states have call predecessors, (80), 6 states have call successors, (80) [2025-03-03 14:12:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 44941 states and 73557 transitions. [2025-03-03 14:12:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-03-03 14:12:50,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:12:50,404 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:12:50,414 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-03 14:12:50,604 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-03 14:12:50,605 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:12:50,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:12:50,605 INFO L85 PathProgramCache]: Analyzing trace with hash 57870913, now seen corresponding path program 1 times [2025-03-03 14:12:50,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:12:50,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453418167] [2025-03-03 14:12:50,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:12:50,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:12:50,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-03 14:12:50,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-03 14:12:50,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:12:50,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:12:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 63 proven. 80 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2025-03-03 14:12:50,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:12:50,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453418167] [2025-03-03 14:12:50,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453418167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:12:50,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146110913] [2025-03-03 14:12:50,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:12:50,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:12:50,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:12:50,976 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-03 14:12:50,977 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-03 14:12:51,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-03 14:12:51,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-03 14:12:51,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:12:51,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:12:51,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 3334 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:12:51,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:12:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 583 proven. 4 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2025-03-03 14:12:51,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:12:51,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 63 proven. 80 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2025-03-03 14:12:51,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146110913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:12:51,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:12:51,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-03 14:12:51,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511855092] [2025-03-03 14:12:51,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:12:51,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 14:12:51,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:12:51,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 14:12:51,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:12:51,985 INFO L87 Difference]: Start difference. First operand 44941 states and 73557 transitions. Second operand has 18 states, 18 states have (on average 24.555555555555557) internal successors, (442), 18 states have internal predecessors, (442), 11 states have call successors, (93), 7 states have call predecessors, (93), 11 states have return successors, (94), 12 states have call predecessors, (94), 11 states have call successors, (94)