./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec14_product11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec14_product11.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a3102ca0659fbbd15269b525dd7b096164ab7cd0af67dfa99033803ea46b0a8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:40:40,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:40:40,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:40:40,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:40:40,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:40:40,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:40:40,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:40:40,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:40:40,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:40:40,493 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:40:40,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:40:40,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:40:40,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:40:40,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:40:40,494 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:40:40,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:40:40,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:40:40,495 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:40:40,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:40:40,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:40:40,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:40:40,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:40:40,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:40:40,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:40:40,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:40:40,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:40:40,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:40:40,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:40:40,496 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:40:40,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:40:40,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:40:40,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:40:40,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:40:40,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:40:40,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:40:40,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:40:40,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:40:40,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:40:40,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:40:40,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:40:40,497 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:40:40,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:40:40,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:40:40,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:40:40,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:40:40,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:40:40,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:40:40,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:40:40,498 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a3102ca0659fbbd15269b525dd7b096164ab7cd0af67dfa99033803ea46b0a8e [2025-01-09 03:40:40,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:40:40,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:40:40,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:40:40,722 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:40:40,723 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:40:40,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec14_product11.cil.c [2025-01-09 03:40:41,943 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c9f0efc7/36d1bc9a2c634081be2188beb83bf911/FLAGcf7915359 [2025-01-09 03:40:42,274 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:40:42,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product11.cil.c [2025-01-09 03:40:42,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c9f0efc7/36d1bc9a2c634081be2188beb83bf911/FLAGcf7915359 [2025-01-09 03:40:42,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c9f0efc7/36d1bc9a2c634081be2188beb83bf911 [2025-01-09 03:40:42,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:40:42,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:40:42,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:40:42,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:40:42,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:40:42,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:40:42" (1/1) ... [2025-01-09 03:40:42,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d24e16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:42, skipping insertion in model container [2025-01-09 03:40:42,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:40:42" (1/1) ... [2025-01-09 03:40:42,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:40:42,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product11.cil.c[3700,3713] [2025-01-09 03:40:42,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:40:42,895 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:40:42,901 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-01-09 03:40:42,901 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [86] [2025-01-09 03:40:42,902 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [186] [2025-01-09 03:40:42,902 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [195] [2025-01-09 03:40:42,902 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [315] [2025-01-09 03:40:42,902 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [355] [2025-01-09 03:40:42,903 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [705] [2025-01-09 03:40:42,903 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1071] [2025-01-09 03:40:42,903 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1738] [2025-01-09 03:40:42,903 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3255] [2025-01-09 03:40:42,912 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product11.cil.c[3700,3713] [2025-01-09 03:40:42,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:40:43,006 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:40:43,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:43 WrapperNode [2025-01-09 03:40:43,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:40:43,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:40:43,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:40:43,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:40:43,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:43" (1/1) ... [2025-01-09 03:40:43,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:43" (1/1) ... [2025-01-09 03:40:43,057 INFO L138 Inliner]: procedures = 90, calls = 331, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 1057 [2025-01-09 03:40:43,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:40:43,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:40:43,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:40:43,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:40:43,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:43" (1/1) ... [2025-01-09 03:40:43,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:43" (1/1) ... [2025-01-09 03:40:43,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:43" (1/1) ... [2025-01-09 03:40:43,109 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-01-09 03:40:43,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:43" (1/1) ... [2025-01-09 03:40:43,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:43" (1/1) ... [2025-01-09 03:40:43,130 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:43" (1/1) ... [2025-01-09 03:40:43,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:43" (1/1) ... [2025-01-09 03:40:43,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:43" (1/1) ... [2025-01-09 03:40:43,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:43" (1/1) ... [2025-01-09 03:40:43,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:43" (1/1) ... [2025-01-09 03:40:43,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:40:43,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:40:43,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:40:43,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:40:43,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:43" (1/1) ... [2025-01-09 03:40:43,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:40:43,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:40:43,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:40:43,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:40:43,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:40:43,208 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-01-09 03:40:43,208 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-01-09 03:40:43,208 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:40:43,208 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:40:43,208 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-01-09 03:40:43,208 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-01-09 03:40:43,208 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:40:43,208 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:40:43,208 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-01-09 03:40:43,208 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-01-09 03:40:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:40:43,209 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:40:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:40:43,209 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:40:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:40:43,209 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:40:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:40:43,209 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:40:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:40:43,209 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:40:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:40:43,209 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:40:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-01-09 03:40:43,210 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-01-09 03:40:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:40:43,210 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:40:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-01-09 03:40:43,210 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-01-09 03:40:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:40:43,210 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:40:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:40:43,210 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:40:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:40:43,210 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:40:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:40:43,210 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:40:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:40:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:40:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:40:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:40:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:40:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:40:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:40:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:40:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:40:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:40:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:40:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:40:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:40:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:40:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:40:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:40:43,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:40:43,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:40:43,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:40:43,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:40:43,212 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:40:43,212 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:40:43,212 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:40:43,212 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:40:43,212 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:40:43,212 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:40:43,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:40:43,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:40:43,212 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:40:43,212 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:40:43,335 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:40:43,337 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:40:44,176 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2025-01-09 03:40:44,176 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:40:44,198 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:40:44,202 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:40:44,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:40:44 BoogieIcfgContainer [2025-01-09 03:40:44,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:40:44,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:40:44,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:40:44,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:40:44,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:40:42" (1/3) ... [2025-01-09 03:40:44,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c0b9b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:40:44, skipping insertion in model container [2025-01-09 03:40:44,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:40:43" (2/3) ... [2025-01-09 03:40:44,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c0b9b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:40:44, skipping insertion in model container [2025-01-09 03:40:44,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:40:44" (3/3) ... [2025-01-09 03:40:44,211 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product11.cil.c [2025-01-09 03:40:44,221 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:40:44,222 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec14_product11.cil.c that has 23 procedures, 525 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:40:44,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:40:44,296 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;@2e83538c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:40:44,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:40:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 525 states, 410 states have (on average 1.6829268292682926) internal successors, (690), 426 states have internal predecessors, (690), 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-01-09 03:40:44,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:40:44,324 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:44,325 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-01-09 03:40:44,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:44,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:44,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2147179444, now seen corresponding path program 1 times [2025-01-09 03:40:44,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:44,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409547457] [2025-01-09 03:40:44,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:44,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:44,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:40:44,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:40:44,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:44,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:40:44,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:44,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409547457] [2025-01-09 03:40:44,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409547457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:44,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:44,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:40:44,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086730117] [2025-01-09 03:40:44,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:44,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:40:44,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:44,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:40:44,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:40:44,839 INFO L87 Difference]: Start difference. First operand has 525 states, 410 states have (on average 1.6829268292682926) internal successors, (690), 426 states have internal predecessors, (690), 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-01-09 03:40:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:45,004 INFO L93 Difference]: Finished difference Result 1043 states and 1744 transitions. [2025-01-09 03:40:45,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:40:45,006 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-01-09 03:40:45,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:45,015 INFO L225 Difference]: With dead ends: 1043 [2025-01-09 03:40:45,016 INFO L226 Difference]: Without dead ends: 520 [2025-01-09 03:40:45,022 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-01-09 03:40:45,024 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 6 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2562 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-01-09 03:40:45,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2562 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:40:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-01-09 03:40:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2025-01-09 03:40:45,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 406 states have (on average 1.6748768472906403) internal successors, (680), 421 states have internal predecessors, (680), 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-01-09 03:40:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 861 transitions. [2025-01-09 03:40:45,076 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 861 transitions. Word has length 101 [2025-01-09 03:40:45,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:45,077 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 861 transitions. [2025-01-09 03:40:45,077 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-01-09 03:40:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 861 transitions. [2025-01-09 03:40:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:40:45,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:45,091 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-01-09 03:40:45,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:40:45,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:45,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:45,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1134767127, now seen corresponding path program 1 times [2025-01-09 03:40:45,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:45,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691832831] [2025-01-09 03:40:45,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:45,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:45,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:40:45,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:40:45,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:45,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:40:45,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:45,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691832831] [2025-01-09 03:40:45,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691832831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:45,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:45,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:40:45,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190829017] [2025-01-09 03:40:45,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:45,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:40:45,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:45,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:40:45,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:40:45,347 INFO L87 Difference]: Start difference. First operand 520 states and 861 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-01-09 03:40:45,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:45,433 INFO L93 Difference]: Finished difference Result 1023 states and 1699 transitions. [2025-01-09 03:40:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:40:45,434 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-01-09 03:40:45,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:45,439 INFO L225 Difference]: With dead ends: 1023 [2025-01-09 03:40:45,439 INFO L226 Difference]: Without dead ends: 520 [2025-01-09 03:40:45,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:40:45,444 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 4 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2534 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-01-09 03:40:45,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2534 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:40:45,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-01-09 03:40:45,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2025-01-09 03:40:45,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 406 states have (on average 1.6724137931034482) internal successors, (679), 421 states have internal predecessors, (679), 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-01-09 03:40:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 860 transitions. [2025-01-09 03:40:45,475 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 860 transitions. Word has length 102 [2025-01-09 03:40:45,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:45,475 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 860 transitions. [2025-01-09 03:40:45,476 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-01-09 03:40:45,476 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 860 transitions. [2025-01-09 03:40:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 03:40:45,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:45,482 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-01-09 03:40:45,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:40:45,482 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:45,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:45,486 INFO L85 PathProgramCache]: Analyzing trace with hash -744945112, now seen corresponding path program 1 times [2025-01-09 03:40:45,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:45,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933259735] [2025-01-09 03:40:45,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:45,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:45,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:40:45,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:40:45,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:45,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:40:45,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:45,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933259735] [2025-01-09 03:40:45,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933259735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:45,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:45,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:40:45,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443928904] [2025-01-09 03:40:45,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:45,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:40:45,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:45,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:40:45,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:40:45,609 INFO L87 Difference]: Start difference. First operand 520 states and 860 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-01-09 03:40:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:45,662 INFO L93 Difference]: Finished difference Result 1023 states and 1698 transitions. [2025-01-09 03:40:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:40:45,662 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-01-09 03:40:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:45,666 INFO L225 Difference]: With dead ends: 1023 [2025-01-09 03:40:45,666 INFO L226 Difference]: Without dead ends: 520 [2025-01-09 03:40:45,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:40:45,670 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 3 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2534 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-01-09 03:40:45,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2534 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:40:45,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-01-09 03:40:45,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2025-01-09 03:40:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 406 states have (on average 1.6699507389162562) internal successors, (678), 421 states have internal predecessors, (678), 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-01-09 03:40:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 859 transitions. [2025-01-09 03:40:45,694 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 859 transitions. Word has length 103 [2025-01-09 03:40:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:45,694 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 859 transitions. [2025-01-09 03:40:45,694 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-01-09 03:40:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 859 transitions. [2025-01-09 03:40:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 03:40:45,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:45,697 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-01-09 03:40:45,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:40:45,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:45,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:45,698 INFO L85 PathProgramCache]: Analyzing trace with hash 572676787, now seen corresponding path program 1 times [2025-01-09 03:40:45,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:45,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227089069] [2025-01-09 03:40:45,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:45,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:45,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 03:40:45,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 03:40:45,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:45,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:40:45,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:45,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227089069] [2025-01-09 03:40:45,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227089069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:45,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:45,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:40:45,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407102563] [2025-01-09 03:40:45,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:45,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:40:45,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:45,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:40:45,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:40:45,808 INFO L87 Difference]: Start difference. First operand 520 states and 859 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-01-09 03:40:45,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:45,863 INFO L93 Difference]: Finished difference Result 1023 states and 1697 transitions. [2025-01-09 03:40:45,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:40:45,864 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-01-09 03:40:45,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:45,867 INFO L225 Difference]: With dead ends: 1023 [2025-01-09 03:40:45,867 INFO L226 Difference]: Without dead ends: 520 [2025-01-09 03:40:45,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:40:45,872 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 2 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2534 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-01-09 03:40:45,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2534 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:40:45,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-01-09 03:40:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2025-01-09 03:40:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 406 states have (on average 1.667487684729064) internal successors, (677), 421 states have internal predecessors, (677), 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-01-09 03:40:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 858 transitions. [2025-01-09 03:40:45,894 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 858 transitions. Word has length 104 [2025-01-09 03:40:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:45,894 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 858 transitions. [2025-01-09 03:40:45,894 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-01-09 03:40:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 858 transitions. [2025-01-09 03:40:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 03:40:45,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:45,898 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-01-09 03:40:45,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:40:45,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:45,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:45,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2071558140, now seen corresponding path program 1 times [2025-01-09 03:40:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:45,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211186176] [2025-01-09 03:40:45,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:45,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:45,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 03:40:45,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 03:40:45,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:45,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:40:46,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:46,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211186176] [2025-01-09 03:40:46,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211186176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:46,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:46,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:40:46,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294050886] [2025-01-09 03:40:46,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:46,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:40:46,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:46,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:40:46,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:40:46,024 INFO L87 Difference]: Start difference. First operand 520 states and 858 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-01-09 03:40:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:46,062 INFO L93 Difference]: Finished difference Result 1023 states and 1696 transitions. [2025-01-09 03:40:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:40:46,063 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-01-09 03:40:46,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:46,066 INFO L225 Difference]: With dead ends: 1023 [2025-01-09 03:40:46,066 INFO L226 Difference]: Without dead ends: 520 [2025-01-09 03:40:46,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:40:46,069 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 1 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2534 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-01-09 03:40:46,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2534 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:40:46,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-01-09 03:40:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2025-01-09 03:40:46,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 406 states have (on average 1.6650246305418719) internal successors, (676), 421 states have internal predecessors, (676), 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-01-09 03:40:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 857 transitions. [2025-01-09 03:40:46,090 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 857 transitions. Word has length 105 [2025-01-09 03:40:46,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:46,091 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 857 transitions. [2025-01-09 03:40:46,091 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-01-09 03:40:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 857 transitions. [2025-01-09 03:40:46,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:40:46,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:46,093 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-01-09 03:40:46,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:40:46,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:46,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:46,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1315664207, now seen corresponding path program 1 times [2025-01-09 03:40:46,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:46,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170326892] [2025-01-09 03:40:46,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:46,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:46,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:40:46,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:40:46,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:46,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:46,261 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:40:46,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:46,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170326892] [2025-01-09 03:40:46,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170326892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:46,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:46,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:40:46,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742737601] [2025-01-09 03:40:46,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:46,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:40:46,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:46,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:40:46,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:40:46,262 INFO L87 Difference]: Start difference. First operand 520 states and 857 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-01-09 03:40:46,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:46,348 INFO L93 Difference]: Finished difference Result 1034 states and 1713 transitions. [2025-01-09 03:40:46,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:40:46,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-01-09 03:40:46,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:46,352 INFO L225 Difference]: With dead ends: 1034 [2025-01-09 03:40:46,352 INFO L226 Difference]: Without dead ends: 535 [2025-01-09 03:40:46,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:40:46,355 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 91 mSDsluCounter, 4135 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 4979 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:40:46,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 4979 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:40:46,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-01-09 03:40:46,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 533. [2025-01-09 03:40:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 416 states have (on average 1.6610576923076923) internal successors, (691), 433 states have internal predecessors, (691), 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-01-09 03:40:46,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 877 transitions. [2025-01-09 03:40:46,373 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 877 transitions. Word has length 106 [2025-01-09 03:40:46,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:46,373 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 877 transitions. [2025-01-09 03:40:46,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-01-09 03:40:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 877 transitions. [2025-01-09 03:40:46,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:40:46,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:46,375 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-01-09 03:40:46,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:40:46,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:46,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:46,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2040771474, now seen corresponding path program 1 times [2025-01-09 03:40:46,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:46,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892969236] [2025-01-09 03:40:46,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:46,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:46,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:40:46,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:40:46,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:46,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:40:46,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:46,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892969236] [2025-01-09 03:40:46,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892969236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:46,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:46,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:40:46,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418598184] [2025-01-09 03:40:46,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:46,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:40:46,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:46,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:40:46,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:40:46,454 INFO L87 Difference]: Start difference. First operand 533 states and 877 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-01-09 03:40:46,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:46,496 INFO L93 Difference]: Finished difference Result 1041 states and 1724 transitions. [2025-01-09 03:40:46,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:40:46,496 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-01-09 03:40:46,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:46,500 INFO L225 Difference]: With dead ends: 1041 [2025-01-09 03:40:46,500 INFO L226 Difference]: Without dead ends: 529 [2025-01-09 03:40:46,502 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-01-09 03:40:46,503 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 1 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2529 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-01-09 03:40:46,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2529 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:40:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-01-09 03:40:46,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-01-09 03:40:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 414 states have (on average 1.6618357487922706) internal successors, (688), 430 states have internal predecessors, (688), 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-01-09 03:40:46,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 870 transitions. [2025-01-09 03:40:46,520 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 870 transitions. Word has length 106 [2025-01-09 03:40:46,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:46,521 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 870 transitions. [2025-01-09 03:40:46,521 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-01-09 03:40:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 870 transitions. [2025-01-09 03:40:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:40:46,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:46,523 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-01-09 03:40:46,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:40:46,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:46,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:46,523 INFO L85 PathProgramCache]: Analyzing trace with hash 589626950, now seen corresponding path program 1 times [2025-01-09 03:40:46,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:46,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19954666] [2025-01-09 03:40:46,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:46,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:46,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:40:46,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:40:46,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:46,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:40:46,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:46,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19954666] [2025-01-09 03:40:46,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19954666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:46,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:46,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:40:46,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955263414] [2025-01-09 03:40:46,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:46,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:40:46,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:46,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:40:46,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:40:46,670 INFO L87 Difference]: Start difference. First operand 529 states and 870 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-01-09 03:40:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:46,884 INFO L93 Difference]: Finished difference Result 1084 states and 1796 transitions. [2025-01-09 03:40:46,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:40:46,885 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-01-09 03:40:46,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:46,887 INFO L225 Difference]: With dead ends: 1084 [2025-01-09 03:40:46,888 INFO L226 Difference]: Without dead ends: 561 [2025-01-09 03:40:46,890 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-01-09 03:40:46,890 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 72 mSDsluCounter, 3197 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 4016 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-01-09 03:40:46,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 4016 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:40:46,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-01-09 03:40:46,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 534. [2025-01-09 03:40:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 419 states have (on average 1.6467780429594272) internal successors, (690), 434 states have internal predecessors, (690), 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-01-09 03:40:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 871 transitions. [2025-01-09 03:40:46,907 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 871 transitions. Word has length 107 [2025-01-09 03:40:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:46,907 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 871 transitions. [2025-01-09 03:40:46,907 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-01-09 03:40:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 871 transitions. [2025-01-09 03:40:46,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:40:46,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:46,909 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-01-09 03:40:46,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:40:46,909 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:46,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:46,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1113471534, now seen corresponding path program 1 times [2025-01-09 03:40:46,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:46,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992960619] [2025-01-09 03:40:46,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:46,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:46,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:40:46,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:40:46,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:46,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:40:47,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:47,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992960619] [2025-01-09 03:40:47,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992960619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:47,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:47,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:40:47,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503612698] [2025-01-09 03:40:47,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:47,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:40:47,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:47,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:40:47,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:40:47,020 INFO L87 Difference]: Start difference. First operand 534 states and 871 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-01-09 03:40:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:47,197 INFO L93 Difference]: Finished difference Result 1035 states and 1691 transitions. [2025-01-09 03:40:47,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:40:47,198 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-01-09 03:40:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:47,201 INFO L225 Difference]: With dead ends: 1035 [2025-01-09 03:40:47,201 INFO L226 Difference]: Without dead ends: 552 [2025-01-09 03:40:47,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:40:47,204 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 56 mSDsluCounter, 3185 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3993 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-01-09 03:40:47,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 3993 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:40:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-01-09 03:40:47,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 534. [2025-01-09 03:40:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 419 states have (on average 1.6372315035799523) internal successors, (686), 434 states have internal predecessors, (686), 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-01-09 03:40:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 867 transitions. [2025-01-09 03:40:47,226 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 867 transitions. Word has length 108 [2025-01-09 03:40:47,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:47,226 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 867 transitions. [2025-01-09 03:40:47,226 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-01-09 03:40:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 867 transitions. [2025-01-09 03:40:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:40:47,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:47,228 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-01-09 03:40:47,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:40:47,229 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:47,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:47,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1205260149, now seen corresponding path program 1 times [2025-01-09 03:40:47,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:47,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449947441] [2025-01-09 03:40:47,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:47,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:47,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:40:47,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:40:47,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:47,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:40:47,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:47,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449947441] [2025-01-09 03:40:47,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449947441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:47,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:47,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:40:47,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136099955] [2025-01-09 03:40:47,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:47,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:40:47,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:47,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:40:47,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:40:47,352 INFO L87 Difference]: Start difference. First operand 534 states and 867 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-01-09 03:40:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:47,520 INFO L93 Difference]: Finished difference Result 1035 states and 1687 transitions. [2025-01-09 03:40:47,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:40:47,520 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-01-09 03:40:47,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:47,524 INFO L225 Difference]: With dead ends: 1035 [2025-01-09 03:40:47,524 INFO L226 Difference]: Without dead ends: 552 [2025-01-09 03:40:47,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:40:47,527 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 55 mSDsluCounter, 3181 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 3988 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-01-09 03:40:47,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 3988 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:40:47,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-01-09 03:40:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 534. [2025-01-09 03:40:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 419 states have (on average 1.6276849642004774) internal successors, (682), 434 states have internal predecessors, (682), 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-01-09 03:40:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 863 transitions. [2025-01-09 03:40:47,542 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 863 transitions. Word has length 109 [2025-01-09 03:40:47,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:47,542 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 863 transitions. [2025-01-09 03:40:47,542 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-01-09 03:40:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 863 transitions. [2025-01-09 03:40:47,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:40:47,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:47,545 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-01-09 03:40:47,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:40:47,545 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:47,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:47,545 INFO L85 PathProgramCache]: Analyzing trace with hash 582946059, now seen corresponding path program 1 times [2025-01-09 03:40:47,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:47,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068377931] [2025-01-09 03:40:47,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:47,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:47,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:40:47,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:40:47,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:47,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:47,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-01-09 03:40:47,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:47,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068377931] [2025-01-09 03:40:47,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068377931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:47,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:47,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:40:47,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962002957] [2025-01-09 03:40:47,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:47,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:40:47,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:47,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:40:47,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:40:47,654 INFO L87 Difference]: Start difference. First operand 534 states and 863 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-01-09 03:40:47,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:47,717 INFO L93 Difference]: Finished difference Result 1026 states and 1669 transitions. [2025-01-09 03:40:47,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:40:47,717 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-01-09 03:40:47,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:47,720 INFO L225 Difference]: With dead ends: 1026 [2025-01-09 03:40:47,720 INFO L226 Difference]: Without dead ends: 522 [2025-01-09 03:40:47,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:40:47,723 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 94 mSDsluCounter, 4069 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 4902 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-01-09 03:40:47,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 4902 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:40:47,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-01-09 03:40:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 513. [2025-01-09 03:40:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 398 states have (on average 1.620603015075377) internal successors, (645), 413 states have internal predecessors, (645), 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-01-09 03:40:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 826 transitions. [2025-01-09 03:40:47,738 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 826 transitions. Word has length 109 [2025-01-09 03:40:47,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:47,738 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 826 transitions. [2025-01-09 03:40:47,738 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-01-09 03:40:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 826 transitions. [2025-01-09 03:40:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:40:47,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:47,740 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-01-09 03:40:47,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:40:47,740 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:47,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:47,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1408916919, now seen corresponding path program 1 times [2025-01-09 03:40:47,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:47,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239724674] [2025-01-09 03:40:47,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:47,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:47,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:40:47,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:40:47,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:47,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:40:47,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:47,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239724674] [2025-01-09 03:40:47,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239724674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:47,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:47,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:40:47,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955110811] [2025-01-09 03:40:47,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:47,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:40:47,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:47,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:40:47,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:40:47,837 INFO L87 Difference]: Start difference. First operand 513 states and 826 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-01-09 03:40:47,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:47,924 INFO L93 Difference]: Finished difference Result 1005 states and 1632 transitions. [2025-01-09 03:40:47,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:40:47,924 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-01-09 03:40:47,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:47,928 INFO L225 Difference]: With dead ends: 1005 [2025-01-09 03:40:47,928 INFO L226 Difference]: Without dead ends: 522 [2025-01-09 03:40:47,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:40:47,930 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 39 mSDsluCounter, 3185 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3993 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-01-09 03:40:47,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3993 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:40:47,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-01-09 03:40:47,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 513. [2025-01-09 03:40:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 398 states have (on average 1.6180904522613064) internal successors, (644), 413 states have internal predecessors, (644), 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-01-09 03:40:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 825 transitions. [2025-01-09 03:40:47,947 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 825 transitions. Word has length 110 [2025-01-09 03:40:47,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:47,947 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 825 transitions. [2025-01-09 03:40:47,948 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-01-09 03:40:47,948 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 825 transitions. [2025-01-09 03:40:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 03:40:47,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:47,951 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-01-09 03:40:47,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:40:47,951 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:47,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:47,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2008684240, now seen corresponding path program 1 times [2025-01-09 03:40:47,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:47,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604130503] [2025-01-09 03:40:47,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:47,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:47,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 03:40:47,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 03:40:47,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:47,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:40:48,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:48,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604130503] [2025-01-09 03:40:48,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604130503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:48,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:48,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:40:48,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552294735] [2025-01-09 03:40:48,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:48,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:40:48,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:48,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:40:48,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:40:48,083 INFO L87 Difference]: Start difference. First operand 513 states and 825 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-01-09 03:40:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:48,169 INFO L93 Difference]: Finished difference Result 1005 states and 1631 transitions. [2025-01-09 03:40:48,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:40:48,170 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-01-09 03:40:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:48,173 INFO L225 Difference]: With dead ends: 1005 [2025-01-09 03:40:48,173 INFO L226 Difference]: Without dead ends: 522 [2025-01-09 03:40:48,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:40:48,177 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 38 mSDsluCounter, 3185 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3993 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-01-09 03:40:48,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3993 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:40:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-01-09 03:40:48,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 513. [2025-01-09 03:40:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 398 states have (on average 1.6155778894472361) internal successors, (643), 413 states have internal predecessors, (643), 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-01-09 03:40:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 824 transitions. [2025-01-09 03:40:48,196 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 824 transitions. Word has length 111 [2025-01-09 03:40:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:48,196 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 824 transitions. [2025-01-09 03:40:48,196 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-01-09 03:40:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 824 transitions. [2025-01-09 03:40:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:40:48,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:48,199 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-01-09 03:40:48,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:40:48,199 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:48,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1616147742, now seen corresponding path program 1 times [2025-01-09 03:40:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:48,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677163475] [2025-01-09 03:40:48,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:48,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:48,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:40:48,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:40:48,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:48,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:40:48,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:48,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677163475] [2025-01-09 03:40:48,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677163475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:48,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:48,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:40:48,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000018537] [2025-01-09 03:40:48,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:48,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:40:48,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:48,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:40:48,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:40:48,281 INFO L87 Difference]: Start difference. First operand 513 states and 824 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-01-09 03:40:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:48,322 INFO L93 Difference]: Finished difference Result 1005 states and 1630 transitions. [2025-01-09 03:40:48,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:40:48,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 112 [2025-01-09 03:40:48,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:48,326 INFO L225 Difference]: With dead ends: 1005 [2025-01-09 03:40:48,326 INFO L226 Difference]: Without dead ends: 522 [2025-01-09 03:40:48,328 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-01-09 03:40:48,329 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 45 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:40:48,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2367 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:40:48,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-01-09 03:40:48,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 513. [2025-01-09 03:40:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 398 states have (on average 1.6130653266331658) internal successors, (642), 413 states have internal predecessors, (642), 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-01-09 03:40:48,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 823 transitions. [2025-01-09 03:40:48,343 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 823 transitions. Word has length 112 [2025-01-09 03:40:48,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:48,344 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 823 transitions. [2025-01-09 03:40:48,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-01-09 03:40:48,344 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 823 transitions. [2025-01-09 03:40:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:40:48,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:48,346 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-01-09 03:40:48,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:40:48,346 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:48,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:48,346 INFO L85 PathProgramCache]: Analyzing trace with hash 291291548, now seen corresponding path program 1 times [2025-01-09 03:40:48,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:48,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067118339] [2025-01-09 03:40:48,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:48,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:48,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:40:48,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:40:48,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:48,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:40:48,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:48,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067118339] [2025-01-09 03:40:48,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067118339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:48,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:40:48,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:40:48,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441441702] [2025-01-09 03:40:48,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:48,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:40:48,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:48,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:40:48,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:40:48,414 INFO L87 Difference]: Start difference. First operand 513 states and 823 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:40:48,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:48,457 INFO L93 Difference]: Finished difference Result 992 states and 1609 transitions. [2025-01-09 03:40:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:40:48,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-01-09 03:40:48,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:48,460 INFO L225 Difference]: With dead ends: 992 [2025-01-09 03:40:48,460 INFO L226 Difference]: Without dead ends: 515 [2025-01-09 03:40:48,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:40:48,462 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 15 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2343 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:40:48,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2343 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:40:48,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-01-09 03:40:48,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-01-09 03:40:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 400 states have (on average 1.6075) internal successors, (643), 415 states have internal predecessors, (643), 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-01-09 03:40:48,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 824 transitions. [2025-01-09 03:40:48,476 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 824 transitions. Word has length 112 [2025-01-09 03:40:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:48,476 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 824 transitions. [2025-01-09 03:40:48,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:40:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 824 transitions. [2025-01-09 03:40:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:40:48,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:48,478 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-01-09 03:40:48,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:40:48,478 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:48,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:48,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1534507547, now seen corresponding path program 1 times [2025-01-09 03:40:48,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:48,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88687934] [2025-01-09 03:40:48,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:48,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:48,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:40:48,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:40:48,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:48,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 03:40:48,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:48,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88687934] [2025-01-09 03:40:48,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88687934] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:40:48,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157275309] [2025-01-09 03:40:48,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:48,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:48,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:40:48,566 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:40:48,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:40:48,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:40:48,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:40:48,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:48,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:48,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 03:40:48,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:40:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 03:40:48,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:40:48,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157275309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:48,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:40:48,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-01-09 03:40:48,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600295309] [2025-01-09 03:40:48,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:48,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:40:48,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:48,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:40:48,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:40:48,928 INFO L87 Difference]: Start difference. First operand 515 states and 824 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-01-09 03:40:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:49,368 INFO L93 Difference]: Finished difference Result 995 states and 1635 transitions. [2025-01-09 03:40:49,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:40:49,368 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-01-09 03:40:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:49,371 INFO L225 Difference]: With dead ends: 995 [2025-01-09 03:40:49,372 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 03:40:49,374 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-01-09 03:40:49,375 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 769 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1999 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-01-09 03:40:49,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1999 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:40:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 03:40:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-01-09 03:40:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 407 states have (on average 1.6093366093366093) internal successors, (655), 422 states have internal predecessors, (655), 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-01-09 03:40:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 837 transitions. [2025-01-09 03:40:49,392 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 837 transitions. Word has length 113 [2025-01-09 03:40:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:49,392 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 837 transitions. [2025-01-09 03:40:49,392 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-01-09 03:40:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 837 transitions. [2025-01-09 03:40:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:40:49,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:49,394 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-01-09 03:40:49,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:40:49,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 03:40:49,595 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:49,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash -267935092, now seen corresponding path program 1 times [2025-01-09 03:40:49,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:49,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112836262] [2025-01-09 03:40:49,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:49,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:49,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:40:49,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:40:49,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:49,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:40:49,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112836262] [2025-01-09 03:40:49,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112836262] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:40:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775781686] [2025-01-09 03:40:49,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:49,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:49,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:40:49,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:40:49,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:40:49,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:40:49,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:40:49,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:49,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:49,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 03:40:49,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:40:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:40:50,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:40:50,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775781686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:50,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:40:50,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-01-09 03:40:50,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970741462] [2025-01-09 03:40:50,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:50,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:40:50,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:50,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:40:50,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:40:50,052 INFO L87 Difference]: Start difference. First operand 523 states and 837 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-01-09 03:40:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:50,466 INFO L93 Difference]: Finished difference Result 1011 states and 1658 transitions. [2025-01-09 03:40:50,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:40:50,466 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-01-09 03:40:50,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:50,469 INFO L225 Difference]: With dead ends: 1011 [2025-01-09 03:40:50,470 INFO L226 Difference]: Without dead ends: 531 [2025-01-09 03:40:50,472 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-01-09 03:40:50,472 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 760 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1996 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-01-09 03:40:50,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1996 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:40:50,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-01-09 03:40:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-01-09 03:40:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 414 states have (on average 1.6111111111111112) internal successors, (667), 429 states have internal predecessors, (667), 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-01-09 03:40:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 850 transitions. [2025-01-09 03:40:50,490 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 850 transitions. Word has length 116 [2025-01-09 03:40:50,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:50,490 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 850 transitions. [2025-01-09 03:40:50,491 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-01-09 03:40:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 850 transitions. [2025-01-09 03:40:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:40:50,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:50,497 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-01-09 03:40:50,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:40:50,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 03:40:50,697 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:50,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash -110457087, now seen corresponding path program 1 times [2025-01-09 03:40:50,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:50,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539034251] [2025-01-09 03:40:50,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:50,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:50,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:40:50,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:40:50,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:50,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 03:40:50,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:50,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539034251] [2025-01-09 03:40:50,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539034251] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:40:50,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800866196] [2025-01-09 03:40:50,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:50,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:50,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:40:50,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:40:50,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:40:51,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:40:51,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:40:51,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:51,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:51,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 03:40:51,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:40:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 03:40:51,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:40:51,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800866196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:51,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:40:51,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-01-09 03:40:51,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102743218] [2025-01-09 03:40:51,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:51,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:40:51,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:51,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:40:51,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:40:51,259 INFO L87 Difference]: Start difference. First operand 531 states and 850 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-01-09 03:40:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:51,671 INFO L93 Difference]: Finished difference Result 1027 states and 1681 transitions. [2025-01-09 03:40:51,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:40:51,671 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-01-09 03:40:51,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:51,677 INFO L225 Difference]: With dead ends: 1027 [2025-01-09 03:40:51,677 INFO L226 Difference]: Without dead ends: 539 [2025-01-09 03:40:51,680 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-01-09 03:40:51,681 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 757 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1993 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:40:51,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1993 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:40:51,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-01-09 03:40:51,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-01-09 03:40:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 421 states have (on average 1.6128266033254157) internal successors, (679), 436 states have internal predecessors, (679), 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-01-09 03:40:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 863 transitions. [2025-01-09 03:40:51,707 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 863 transitions. Word has length 119 [2025-01-09 03:40:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:51,708 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 863 transitions. [2025-01-09 03:40:51,708 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-01-09 03:40:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 863 transitions. [2025-01-09 03:40:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:40:51,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:51,711 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-01-09 03:40:51,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:40:51,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:51,912 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:51,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash -259563424, now seen corresponding path program 1 times [2025-01-09 03:40:51,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:51,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9632591] [2025-01-09 03:40:51,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:51,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:51,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:40:51,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:40:51,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:51,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:40:52,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:52,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9632591] [2025-01-09 03:40:52,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9632591] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:40:52,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133261608] [2025-01-09 03:40:52,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:52,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:52,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:40:52,027 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:40:52,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:40:52,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:40:52,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:40:52,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:52,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:52,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 03:40:52,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:40:52,329 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:40:52,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:40:52,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133261608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:52,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:40:52,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-01-09 03:40:52,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363549529] [2025-01-09 03:40:52,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:52,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:40:52,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:52,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:40:52,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:40:52,331 INFO L87 Difference]: Start difference. First operand 539 states and 863 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-01-09 03:40:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:52,837 INFO L93 Difference]: Finished difference Result 1043 states and 1704 transitions. [2025-01-09 03:40:52,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:40:52,838 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-01-09 03:40:52,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:52,841 INFO L225 Difference]: With dead ends: 1043 [2025-01-09 03:40:52,841 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 03:40:52,843 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-01-09 03:40:52,843 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 751 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1990 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.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:40:52,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1990 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 03:40:52,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 03:40:52,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-01-09 03:40:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 428 states have (on average 1.6144859813084111) internal successors, (691), 443 states have internal predecessors, (691), 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-01-09 03:40:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 876 transitions. [2025-01-09 03:40:52,857 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 876 transitions. Word has length 122 [2025-01-09 03:40:52,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:52,857 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 876 transitions. [2025-01-09 03:40:52,857 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-01-09 03:40:52,857 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 876 transitions. [2025-01-09 03:40:52,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:40:52,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:52,859 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-01-09 03:40:52,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:40:53,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:53,059 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:53,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:53,060 INFO L85 PathProgramCache]: Analyzing trace with hash -27921891, now seen corresponding path program 1 times [2025-01-09 03:40:53,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:53,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033325158] [2025-01-09 03:40:53,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:53,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:53,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:40:53,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:40:53,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:53,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:40:53,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:53,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033325158] [2025-01-09 03:40:53,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033325158] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:40:53,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869356520] [2025-01-09 03:40:53,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:53,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:53,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:40:53,211 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:40:53,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:40:53,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:40:53,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:40:53,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:53,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:53,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 1220 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 03:40:53,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:40:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 03:40:53,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:40:53,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869356520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:53,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:40:53,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2025-01-09 03:40:53,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641014074] [2025-01-09 03:40:53,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:53,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:40:53,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:53,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:40:53,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:40:53,597 INFO L87 Difference]: Start difference. First operand 547 states and 876 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-01-09 03:40:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:54,047 INFO L93 Difference]: Finished difference Result 1553 states and 2555 transitions. [2025-01-09 03:40:54,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:40:54,048 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-01-09 03:40:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:54,054 INFO L225 Difference]: With dead ends: 1553 [2025-01-09 03:40:54,054 INFO L226 Difference]: Without dead ends: 1049 [2025-01-09 03:40:54,056 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-01-09 03:40:54,056 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 715 mSDsluCounter, 2697 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 3537 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-01-09 03:40:54,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 3537 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:40:54,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-01-09 03:40:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1042. [2025-01-09 03:40:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 815 states have (on average 1.6343558282208588) internal successors, (1332), 844 states have internal predecessors, (1332), 174 states have call successors, (174), 52 states have call predecessors, (174), 52 states have return successors, (193), 171 states have call predecessors, (193), 172 states have call successors, (193) [2025-01-09 03:40:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1699 transitions. [2025-01-09 03:40:54,116 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1699 transitions. Word has length 125 [2025-01-09 03:40:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:54,116 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1699 transitions. [2025-01-09 03:40:54,116 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-01-09 03:40:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1699 transitions. [2025-01-09 03:40:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:40:54,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:54,119 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-01-09 03:40:54,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:40:54,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:54,319 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:54,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:54,320 INFO L85 PathProgramCache]: Analyzing trace with hash 411663453, now seen corresponding path program 1 times [2025-01-09 03:40:54,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:54,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108984166] [2025-01-09 03:40:54,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:54,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:54,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:40:54,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:40:54,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:54,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:40:54,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:54,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108984166] [2025-01-09 03:40:54,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108984166] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:40:54,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183339668] [2025-01-09 03:40:54,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:54,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:54,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:40:54,496 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:40:54,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:40:54,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:40:54,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:40:54,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:54,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:54,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 03:40:54,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:40:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 03:40:54,822 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:40:54,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183339668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:54,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:40:54,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-01-09 03:40:54,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494789502] [2025-01-09 03:40:54,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:54,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:40:54,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:54,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:40:54,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:40:54,823 INFO L87 Difference]: Start difference. First operand 1042 states and 1699 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-01-09 03:40:55,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:55,124 INFO L93 Difference]: Finished difference Result 2059 states and 3406 transitions. [2025-01-09 03:40:55,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:40:55,125 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-01-09 03:40:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:55,131 INFO L225 Difference]: With dead ends: 2059 [2025-01-09 03:40:55,131 INFO L226 Difference]: Without dead ends: 1060 [2025-01-09 03:40:55,134 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-01-09 03:40:55,135 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 733 mSDsluCounter, 2262 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:40:55,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 3111 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:40:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-01-09 03:40:55,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1052. [2025-01-09 03:40:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 821 states have (on average 1.6297198538367843) internal successors, (1338), 853 states have internal predecessors, (1338), 176 states have call successors, (176), 53 states have call predecessors, (176), 54 states have return successors, (203), 171 states have call predecessors, (203), 174 states have call successors, (203) [2025-01-09 03:40:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1717 transitions. [2025-01-09 03:40:55,167 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1717 transitions. Word has length 127 [2025-01-09 03:40:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:55,168 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1717 transitions. [2025-01-09 03:40:55,168 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-01-09 03:40:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1717 transitions. [2025-01-09 03:40:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 03:40:55,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:55,170 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-01-09 03:40:55,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 03:40:55,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-09 03:40:55,374 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:55,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:55,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1508185051, now seen corresponding path program 1 times [2025-01-09 03:40:55,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:55,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378316286] [2025-01-09 03:40:55,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:55,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:55,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:40:55,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:40:55,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:55,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:40:55,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:55,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378316286] [2025-01-09 03:40:55,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378316286] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:40:55,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666784777] [2025-01-09 03:40:55,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:55,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:55,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:40:55,684 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:40:55,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 03:40:55,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:40:55,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:40:55,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:55,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:55,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:40:55,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:40:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 03:40:55,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:40:55,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666784777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:55,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:40:55,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-01-09 03:40:55,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95025992] [2025-01-09 03:40:55,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:55,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:40:55,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:55,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:40:55,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:40:55,968 INFO L87 Difference]: Start difference. First operand 1052 states and 1717 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-01-09 03:40:56,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:56,026 INFO L93 Difference]: Finished difference Result 2556 states and 4243 transitions. [2025-01-09 03:40:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:40:56,028 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-01-09 03:40:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:56,035 INFO L225 Difference]: With dead ends: 2556 [2025-01-09 03:40:56,036 INFO L226 Difference]: Without dead ends: 1548 [2025-01-09 03:40:56,040 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-01-09 03:40:56,042 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 765 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:40:56,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 2289 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:40:56,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2025-01-09 03:40:56,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1052. [2025-01-09 03:40:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 821 states have (on average 1.628501827040195) internal successors, (1337), 853 states have internal predecessors, (1337), 176 states have call successors, (176), 53 states have call predecessors, (176), 54 states have return successors, (203), 171 states have call predecessors, (203), 174 states have call successors, (203) [2025-01-09 03:40:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1716 transitions. [2025-01-09 03:40:56,086 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1716 transitions. Word has length 132 [2025-01-09 03:40:56,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:56,086 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1716 transitions. [2025-01-09 03:40:56,086 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-01-09 03:40:56,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1716 transitions. [2025-01-09 03:40:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 03:40:56,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:56,089 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-01-09 03:40:56,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 03:40:56,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:56,291 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:56,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:56,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2085182371, now seen corresponding path program 1 times [2025-01-09 03:40:56,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:56,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832639884] [2025-01-09 03:40:56,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:56,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:56,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:40:56,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:40:56,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:56,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:40:56,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:56,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832639884] [2025-01-09 03:40:56,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832639884] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:40:56,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040438629] [2025-01-09 03:40:56,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:56,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:56,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:40:56,484 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:40:56,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 03:40:56,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:40:56,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:40:56,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:56,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:56,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 03:40:56,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:40:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 03:40:56,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:40:56,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040438629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:56,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:40:56,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-01-09 03:40:56,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360144433] [2025-01-09 03:40:56,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:56,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:40:56,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:56,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:40:56,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:40:56,770 INFO L87 Difference]: Start difference. First operand 1052 states and 1716 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-01-09 03:40:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:56,830 INFO L93 Difference]: Finished difference Result 2632 states and 4319 transitions. [2025-01-09 03:40:56,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:40:56,831 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-01-09 03:40:56,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:56,839 INFO L225 Difference]: With dead ends: 2632 [2025-01-09 03:40:56,839 INFO L226 Difference]: Without dead ends: 1625 [2025-01-09 03:40:56,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:40:56,844 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 344 mSDsluCounter, 2556 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 3434 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-01-09 03:40:56,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 3434 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:40:56,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2025-01-09 03:40:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1625. [2025-01-09 03:40:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1273 states have (on average 1.6025137470542026) internal successors, (2040), 1310 states have internal predecessors, (2040), 260 states have call successors, (260), 89 states have call predecessors, (260), 91 states have return successors, (339), 251 states have call predecessors, (339), 256 states have call successors, (339) [2025-01-09 03:40:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2639 transitions. [2025-01-09 03:40:56,903 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2639 transitions. Word has length 132 [2025-01-09 03:40:56,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:56,904 INFO L471 AbstractCegarLoop]: Abstraction has 1625 states and 2639 transitions. [2025-01-09 03:40:56,904 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-01-09 03:40:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2639 transitions. [2025-01-09 03:40:56,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 03:40:56,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:56,907 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-01-09 03:40:56,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 03:40:57,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:57,107 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:57,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:57,108 INFO L85 PathProgramCache]: Analyzing trace with hash 993631199, now seen corresponding path program 1 times [2025-01-09 03:40:57,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:57,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272623641] [2025-01-09 03:40:57,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:57,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:57,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:40:57,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:40:57,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:57,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:40:57,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:57,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272623641] [2025-01-09 03:40:57,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272623641] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:40:57,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163090311] [2025-01-09 03:40:57,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:57,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:57,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:40:57,253 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:40:57,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 03:40:57,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:40:57,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:40:57,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:57,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:57,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 1229 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 03:40:57,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:40:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 03:40:57,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:40:57,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163090311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:57,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:40:57,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2025-01-09 03:40:57,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630726589] [2025-01-09 03:40:57,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:57,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:40:57,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:57,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:40:57,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:40:57,531 INFO L87 Difference]: Start difference. First operand 1625 states and 2639 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-01-09 03:40:57,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:57,616 INFO L93 Difference]: Finished difference Result 2955 states and 4794 transitions. [2025-01-09 03:40:57,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:40:57,617 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-01-09 03:40:57,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:57,627 INFO L225 Difference]: With dead ends: 2955 [2025-01-09 03:40:57,627 INFO L226 Difference]: Without dead ends: 1375 [2025-01-09 03:40:57,637 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-01-09 03:40:57,638 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 525 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1300 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-01-09 03:40:57,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1300 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:40:57,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-01-09 03:40:57,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1375. [2025-01-09 03:40:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1075 states have (on average 1.584186046511628) internal successors, (1703), 1103 states have internal predecessors, (1703), 219 states have call successors, (219), 81 states have call predecessors, (219), 80 states have return successors, (275), 214 states have call predecessors, (275), 215 states have call successors, (275) [2025-01-09 03:40:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2197 transitions. [2025-01-09 03:40:57,685 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2197 transitions. Word has length 132 [2025-01-09 03:40:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:57,685 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 2197 transitions. [2025-01-09 03:40:57,685 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-01-09 03:40:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2197 transitions. [2025-01-09 03:40:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 03:40:57,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:57,689 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-01-09 03:40:57,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 03:40:57,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:57,893 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:57,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:57,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1811567327, now seen corresponding path program 1 times [2025-01-09 03:40:57,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:57,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116179419] [2025-01-09 03:40:57,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:57,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:57,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 03:40:57,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 03:40:57,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:57,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-01-09 03:40:58,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:58,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116179419] [2025-01-09 03:40:58,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116179419] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:40:58,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495036384] [2025-01-09 03:40:58,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:58,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:58,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:40:58,035 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:40:58,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 03:40:58,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 03:40:58,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 03:40:58,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:58,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:58,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 1324 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:40:58,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:40:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:40:58,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:40:58,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495036384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:58,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:40:58,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-01-09 03:40:58,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718969808] [2025-01-09 03:40:58,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:58,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:40:58,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:58,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:40:58,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:40:58,272 INFO L87 Difference]: Start difference. First operand 1375 states and 2197 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-01-09 03:40:58,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:58,433 INFO L93 Difference]: Finished difference Result 2795 states and 4527 transitions. [2025-01-09 03:40:58,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:40:58,434 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-01-09 03:40:58,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:58,441 INFO L225 Difference]: With dead ends: 2795 [2025-01-09 03:40:58,441 INFO L226 Difference]: Without dead ends: 1465 [2025-01-09 03:40:58,445 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-01-09 03:40:58,446 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 144 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2206 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-01-09 03:40:58,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2206 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:40:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2025-01-09 03:40:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1453. [2025-01-09 03:40:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1151 states have (on average 1.6064291920069504) internal successors, (1849), 1179 states have internal predecessors, (1849), 219 states have call successors, (219), 83 states have call predecessors, (219), 82 states have return successors, (275), 214 states have call predecessors, (275), 215 states have call successors, (275) [2025-01-09 03:40:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2343 transitions. [2025-01-09 03:40:58,529 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2343 transitions. Word has length 155 [2025-01-09 03:40:58,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:58,529 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 2343 transitions. [2025-01-09 03:40:58,530 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-01-09 03:40:58,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2343 transitions. [2025-01-09 03:40:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 03:40:58,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:58,534 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-01-09 03:40:58,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 03:40:58,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 03:40:58,734 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:58,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:58,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1116636432, now seen corresponding path program 1 times [2025-01-09 03:40:58,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:58,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455220889] [2025-01-09 03:40:58,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:58,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 03:40:58,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 03:40:58,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:58,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 03:40:58,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:58,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455220889] [2025-01-09 03:40:58,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455220889] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:40:58,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791820577] [2025-01-09 03:40:58,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:58,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:58,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:40:58,892 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:40:58,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 03:40:59,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 03:40:59,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 03:40:59,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:59,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:59,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:40:59,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:40:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 03:40:59,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:40:59,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791820577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:40:59,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:40:59,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-01-09 03:40:59,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294929062] [2025-01-09 03:40:59,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:40:59,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:40:59,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:40:59,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:40:59,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:40:59,159 INFO L87 Difference]: Start difference. First operand 1453 states and 2343 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-01-09 03:40:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:40:59,379 INFO L93 Difference]: Finished difference Result 2957 states and 4821 transitions. [2025-01-09 03:40:59,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:40:59,380 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-01-09 03:40:59,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:40:59,388 INFO L225 Difference]: With dead ends: 2957 [2025-01-09 03:40:59,388 INFO L226 Difference]: Without dead ends: 1549 [2025-01-09 03:40:59,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:40:59,392 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 142 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 2203 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:40:59,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 2203 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:40:59,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2025-01-09 03:40:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1531. [2025-01-09 03:40:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1227 states have (on average 1.625916870415648) internal successors, (1995), 1255 states have internal predecessors, (1995), 219 states have call successors, (219), 85 states have call predecessors, (219), 84 states have return successors, (275), 214 states have call predecessors, (275), 215 states have call successors, (275) [2025-01-09 03:40:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 2489 transitions. [2025-01-09 03:40:59,427 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 2489 transitions. Word has length 160 [2025-01-09 03:40:59,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:40:59,428 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 2489 transitions. [2025-01-09 03:40:59,429 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-01-09 03:40:59,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2489 transitions. [2025-01-09 03:40:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 03:40:59,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:40:59,432 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-01-09 03:40:59,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 03:40:59,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 03:40:59,634 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:40:59,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:40:59,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1635329952, now seen corresponding path program 1 times [2025-01-09 03:40:59,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:40:59,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483087877] [2025-01-09 03:40:59,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:59,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:40:59,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 03:40:59,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 03:40:59,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:40:59,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:40:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-01-09 03:40:59,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:40:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483087877] [2025-01-09 03:40:59,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483087877] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:40:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937992459] [2025-01-09 03:40:59,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:40:59,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:40:59,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:40:59,857 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:40:59,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 03:40:59,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 03:41:00,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 03:41:00,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:41:00,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:41:00,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:41:00,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:41:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:41:00,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:41:00,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937992459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:41:00,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:41:00,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-01-09 03:41:00,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957868265] [2025-01-09 03:41:00,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:41:00,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:41:00,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:41:00,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:41:00,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:41:00,157 INFO L87 Difference]: Start difference. First operand 1531 states and 2489 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-01-09 03:41:00,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:41:00,332 INFO L93 Difference]: Finished difference Result 3119 states and 5115 transitions. [2025-01-09 03:41:00,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:41:00,333 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-01-09 03:41:00,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:41:00,341 INFO L225 Difference]: With dead ends: 3119 [2025-01-09 03:41:00,341 INFO L226 Difference]: Without dead ends: 1633 [2025-01-09 03:41:00,346 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-01-09 03:41:00,346 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 140 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 2200 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-01-09 03:41:00,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 2200 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:41:00,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2025-01-09 03:41:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1609. [2025-01-09 03:41:00,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1303 states have (on average 1.6431312356101304) internal successors, (2141), 1331 states have internal predecessors, (2141), 219 states have call successors, (219), 87 states have call predecessors, (219), 86 states have return successors, (275), 214 states have call predecessors, (275), 215 states have call successors, (275) [2025-01-09 03:41:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2635 transitions. [2025-01-09 03:41:00,389 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2635 transitions. Word has length 164 [2025-01-09 03:41:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:41:00,390 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2635 transitions. [2025-01-09 03:41:00,390 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-01-09 03:41:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2635 transitions. [2025-01-09 03:41:00,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 03:41:00,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:41:00,394 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-01-09 03:41:00,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-09 03:41:00,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:41:00,595 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:41:00,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:41:00,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1020859391, now seen corresponding path program 1 times [2025-01-09 03:41:00,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:41:00,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487334086] [2025-01-09 03:41:00,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:41:00,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:41:00,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 03:41:00,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 03:41:00,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:41:00,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:41:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-09 03:41:00,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:41:00,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487334086] [2025-01-09 03:41:00,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487334086] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:41:00,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501743906] [2025-01-09 03:41:00,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:41:00,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:41:00,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:41:00,758 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:41:00,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 03:41:00,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 03:41:00,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 03:41:00,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:41:00,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:41:01,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:41:01,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:41:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:41:01,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:41:01,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501743906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:41:01,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:41:01,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-01-09 03:41:01,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634259582] [2025-01-09 03:41:01,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:41:01,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:41:01,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:41:01,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:41:01,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:41:01,045 INFO L87 Difference]: Start difference. First operand 1609 states and 2635 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-01-09 03:41:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:41:01,269 INFO L93 Difference]: Finished difference Result 3281 states and 5409 transitions. [2025-01-09 03:41:01,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:41:01,269 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-01-09 03:41:01,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:41:01,276 INFO L225 Difference]: With dead ends: 3281 [2025-01-09 03:41:01,277 INFO L226 Difference]: Without dead ends: 1717 [2025-01-09 03:41:01,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:41:01,281 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 138 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 2190 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:41:01,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 2190 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:41:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2025-01-09 03:41:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1687. [2025-01-09 03:41:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1379 states have (on average 1.6584481508339377) internal successors, (2287), 1407 states have internal predecessors, (2287), 219 states have call successors, (219), 89 states have call predecessors, (219), 88 states have return successors, (275), 214 states have call predecessors, (275), 215 states have call successors, (275) [2025-01-09 03:41:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2781 transitions. [2025-01-09 03:41:01,321 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2781 transitions. Word has length 167 [2025-01-09 03:41:01,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:41:01,321 INFO L471 AbstractCegarLoop]: Abstraction has 1687 states and 2781 transitions. [2025-01-09 03:41:01,321 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-01-09 03:41:01,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2781 transitions. [2025-01-09 03:41:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 03:41:01,324 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:41:01,325 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-01-09 03:41:01,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 03:41:01,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 03:41:01,526 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:41:01,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:41:01,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1957193741, now seen corresponding path program 1 times [2025-01-09 03:41:01,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:41:01,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996882250] [2025-01-09 03:41:01,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:41:01,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:41:01,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 03:41:01,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 03:41:01,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:41:01,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:41:01,687 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-01-09 03:41:01,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:41:01,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996882250] [2025-01-09 03:41:01,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996882250] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:41:01,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580303648] [2025-01-09 03:41:01,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:41:01,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:41:01,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:41:01,693 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:41:01,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 03:41:01,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 03:41:01,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 03:41:01,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:41:01,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:41:01,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 03:41:01,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:41:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-01-09 03:41:02,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:41:02,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580303648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:41:02,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:41:02,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-01-09 03:41:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3099434] [2025-01-09 03:41:02,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:41:02,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:41:02,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:41:02,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:41:02,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:41:02,110 INFO L87 Difference]: Start difference. First operand 1687 states and 2781 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-01-09 03:41:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:41:04,300 INFO L93 Difference]: Finished difference Result 5260 states and 8820 transitions. [2025-01-09 03:41:04,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:41:04,301 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-01-09 03:41:04,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:41:04,320 INFO L225 Difference]: With dead ends: 5260 [2025-01-09 03:41:04,320 INFO L226 Difference]: Without dead ends: 3254 [2025-01-09 03:41:04,329 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-01-09 03:41:04,330 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 1836 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 3686 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1933 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 4124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 3686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:41:04,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1933 Valid, 2223 Invalid, 4124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 3686 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 03:41:04,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2025-01-09 03:41:04,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 3234. [2025-01-09 03:41:04,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 2599 states have (on average 1.6621777606771835) internal successors, (4320), 2681 states have internal predecessors, (4320), 455 states have call successors, (455), 159 states have call predecessors, (455), 179 states have return successors, (599), 451 states have call predecessors, (599), 451 states have call successors, (599) [2025-01-09 03:41:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 5374 transitions. [2025-01-09 03:41:04,427 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 5374 transitions. Word has length 169 [2025-01-09 03:41:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:41:04,429 INFO L471 AbstractCegarLoop]: Abstraction has 3234 states and 5374 transitions. [2025-01-09 03:41:04,429 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-01-09 03:41:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 5374 transitions. [2025-01-09 03:41:04,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 03:41:04,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:41:04,436 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-01-09 03:41:04,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-09 03:41:04,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 03:41:04,637 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:41:04,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:41:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash -175200498, now seen corresponding path program 1 times [2025-01-09 03:41:04,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:41:04,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984843999] [2025-01-09 03:41:04,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:41:04,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:41:04,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 03:41:04,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 03:41:04,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:41:04,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:41:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-01-09 03:41:04,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:41:04,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984843999] [2025-01-09 03:41:04,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984843999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:41:04,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:41:04,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:41:04,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683136331] [2025-01-09 03:41:04,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:41:04,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:41:04,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:41:04,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:41:04,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:41:04,751 INFO L87 Difference]: Start difference. First operand 3234 states and 5374 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-01-09 03:41:04,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:41:04,931 INFO L93 Difference]: Finished difference Result 6294 states and 10489 transitions. [2025-01-09 03:41:04,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:41:04,932 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-01-09 03:41:04,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:41:04,946 INFO L225 Difference]: With dead ends: 6294 [2025-01-09 03:41:04,946 INFO L226 Difference]: Without dead ends: 2967 [2025-01-09 03:41:04,956 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-01-09 03:41:04,958 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 32 mSDsluCounter, 4655 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 5436 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:41:04,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 5436 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:41:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2025-01-09 03:41:05,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2955. [2025-01-09 03:41:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2955 states, 2420 states have (on average 1.6838842975206612) internal successors, (4075), 2489 states have internal predecessors, (4075), 375 states have call successors, (375), 147 states have call predecessors, (375), 159 states have return successors, (469), 366 states have call predecessors, (469), 371 states have call successors, (469) [2025-01-09 03:41:05,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 4919 transitions. [2025-01-09 03:41:05,036 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 4919 transitions. Word has length 172 [2025-01-09 03:41:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:41:05,036 INFO L471 AbstractCegarLoop]: Abstraction has 2955 states and 4919 transitions. [2025-01-09 03:41:05,036 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-01-09 03:41:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4919 transitions. [2025-01-09 03:41:05,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-01-09 03:41:05,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:41:05,046 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:41:05,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 03:41:05,046 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:41:05,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:41:05,047 INFO L85 PathProgramCache]: Analyzing trace with hash 872448433, now seen corresponding path program 1 times [2025-01-09 03:41:05,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:41:05,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007053452] [2025-01-09 03:41:05,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:41:05,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:41:05,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 03:41:05,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 03:41:05,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:41:05,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:41:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 36 proven. 99 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 03:41:05,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:41:05,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007053452] [2025-01-09 03:41:05,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007053452] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:41:05,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562413307] [2025-01-09 03:41:05,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:41:05,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:41:05,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:41:05,413 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:41:05,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 03:41:05,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 03:41:05,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 03:41:05,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:41:05,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:41:05,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 3160 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 03:41:05,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:41:06,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 341 proven. 50 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2025-01-09 03:41:06,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:41:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 57 proven. 93 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2025-01-09 03:41:06,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562413307] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:41:06,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:41:06,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 14] total 27 [2025-01-09 03:41:06,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632772971] [2025-01-09 03:41:06,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:41:06,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 03:41:06,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:41:06,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 03:41:06,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2025-01-09 03:41:06,848 INFO L87 Difference]: Start difference. First operand 2955 states and 4919 transitions. Second operand has 27 states, 25 states have (on average 14.48) internal successors, (362), 23 states have internal predecessors, (362), 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-01-09 03:41:49,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:41:49,493 INFO L93 Difference]: Finished difference Result 44957 states and 79966 transitions. [2025-01-09 03:41:49,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 430 states. [2025-01-09 03:41:49,494 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 14.48) internal successors, (362), 23 states have internal predecessors, (362), 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 459 [2025-01-09 03:41:49,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:41:49,830 INFO L225 Difference]: With dead ends: 44957 [2025-01-09 03:41:49,830 INFO L226 Difference]: Without dead ends: 41942 [2025-01-09 03:41:49,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1478 GetRequests, 1029 SyntacticMatches, 4 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92773 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=16349, Invalid=183013, Unknown=0, NotChecked=0, Total=199362 [2025-01-09 03:41:49,908 INFO L435 NwaCegarLoop]: 2389 mSDtfsCounter, 42732 mSDsluCounter, 20622 mSDsCounter, 0 mSdLazyCounter, 67520 mSolverCounterSat, 15215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42746 SdHoareTripleChecker+Valid, 23011 SdHoareTripleChecker+Invalid, 82735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 15215 IncrementalHoareTripleChecker+Valid, 67520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:41:49,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42746 Valid, 23011 Invalid, 82735 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [15215 Valid, 67520 Invalid, 0 Unknown, 0 Unchecked, 31.2s Time] [2025-01-09 03:41:49,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41942 states. [2025-01-09 03:41:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41942 to 33949. [2025-01-09 03:41:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33949 states, 27797 states have (on average 1.6637766665467497) internal successors, (46248), 28662 states have internal predecessors, (46248), 4054 states have call successors, (4054), 1747 states have call predecessors, (4054), 2097 states have return successors, (6439), 4115 states have call predecessors, (6439), 4036 states have call successors, (6439) [2025-01-09 03:41:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33949 states to 33949 states and 56741 transitions. [2025-01-09 03:41:51,539 INFO L78 Accepts]: Start accepts. Automaton has 33949 states and 56741 transitions. Word has length 459 [2025-01-09 03:41:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:41:51,540 INFO L471 AbstractCegarLoop]: Abstraction has 33949 states and 56741 transitions. [2025-01-09 03:41:51,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 14.48) internal successors, (362), 23 states have internal predecessors, (362), 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-01-09 03:41:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 33949 states and 56741 transitions. [2025-01-09 03:41:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-01-09 03:41:51,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:41:51,959 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:41:51,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-09 03:41:52,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:41:52,163 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:41:52,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:41:52,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1900258121, now seen corresponding path program 1 times [2025-01-09 03:41:52,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:41:52,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702803138] [2025-01-09 03:41:52,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:41:52,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:41:52,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-09 03:41:52,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-09 03:41:52,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:41:52,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:41:52,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1230 backedges. 61 proven. 68 refuted. 0 times theorem prover too weak. 1101 trivial. 0 not checked. [2025-01-09 03:41:52,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:41:52,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702803138] [2025-01-09 03:41:52,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702803138] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:41:52,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780017754] [2025-01-09 03:41:52,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:41:52,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:41:52,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:41:52,632 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:41:52,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-09 03:41:52,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-09 03:41:53,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-09 03:41:53,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:41:53,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:41:53,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 3303 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 03:41:53,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:41:53,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1230 backedges. 651 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-01-09 03:41:53,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:41:53,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780017754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:41:53,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:41:53,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-01-09 03:41:53,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265077154] [2025-01-09 03:41:53,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:41:53,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:41:53,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:41:53,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:41:53,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:41:53,206 INFO L87 Difference]: Start difference. First operand 33949 states and 56741 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-01-09 03:41:54,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:41:54,397 INFO L93 Difference]: Finished difference Result 68279 states and 114777 transitions. [2025-01-09 03:41:54,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:41:54,397 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 506 [2025-01-09 03:41:54,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:41:54,560 INFO L225 Difference]: With dead ends: 68279 [2025-01-09 03:41:54,560 INFO L226 Difference]: Without dead ends: 34399 [2025-01-09 03:41:54,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:41:54,699 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 0 mSDsluCounter, 3179 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3976 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-01-09 03:41:54,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3976 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:41:54,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34399 states. [2025-01-09 03:41:56,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34399 to 34273. [2025-01-09 03:41:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34273 states, 28031 states have (on average 1.6582355249545147) internal successors, (46482), 28938 states have internal predecessors, (46482), 4054 states have call successors, (4054), 1747 states have call predecessors, (4054), 2187 states have return successors, (6616), 4163 states have call predecessors, (6616), 4036 states have call successors, (6616) [2025-01-09 03:41:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34273 states to 34273 states and 57152 transitions. [2025-01-09 03:41:56,228 INFO L78 Accepts]: Start accepts. Automaton has 34273 states and 57152 transitions. Word has length 506 [2025-01-09 03:41:56,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:41:56,229 INFO L471 AbstractCegarLoop]: Abstraction has 34273 states and 57152 transitions. [2025-01-09 03:41:56,229 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-01-09 03:41:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 34273 states and 57152 transitions. [2025-01-09 03:41:56,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-01-09 03:41:56,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:41:56,309 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 12, 12, 12, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:41:56,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-09 03:41:56,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:41:56,514 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:41:56,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:41:56,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1583841924, now seen corresponding path program 1 times [2025-01-09 03:41:56,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:41:56,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579715108] [2025-01-09 03:41:56,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:41:56,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:41:56,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-01-09 03:41:56,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-01-09 03:41:56,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:41:56,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:41:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 90 proven. 95 refuted. 0 times theorem prover too weak. 1432 trivial. 0 not checked. [2025-01-09 03:41:56,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:41:56,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579715108] [2025-01-09 03:41:56,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579715108] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:41:56,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815580625] [2025-01-09 03:41:56,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:41:56,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:41:56,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:41:56,970 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:41:56,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-09 03:41:57,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-01-09 03:41:57,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-01-09 03:41:57,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:41:57,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:41:57,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 3420 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 03:41:57,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:41:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 1034 proven. 25 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2025-01-09 03:41:57,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:41:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 117 proven. 99 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2025-01-09 03:41:58,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815580625] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:41:58,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:41:58,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 24 [2025-01-09 03:41:58,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570492688] [2025-01-09 03:41:58,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:41:58,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 03:41:58,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:41:58,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 03:41:58,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2025-01-09 03:41:58,749 INFO L87 Difference]: Start difference. First operand 34273 states and 57152 transitions. Second operand has 24 states, 21 states have (on average 23.571428571428573) internal successors, (495), 22 states have internal predecessors, (495), 17 states have call successors, (123), 8 states have call predecessors, (123), 15 states have return successors, (122), 16 states have call predecessors, (122), 17 states have call successors, (122)