./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product27.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product27.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6cc96375562d846fbf28439914184b0f5b3d70ee1197dff8e1988bf2754bc90e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:31:54,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:31:54,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:31:54,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:31:54,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:31:54,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:31:54,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:31:54,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:31:54,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:31:54,552 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:31:54,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:31:54,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:31:54,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:31:54,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:31:54,555 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:31:54,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:31:54,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:31:54,557 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:31:54,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:31:54,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:31:54,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:31:54,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:31:54,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:31:54,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:31:54,561 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:31:54,561 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:31:54,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:31:54,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:31:54,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:31:54,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:31:54,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:31:54,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:31:54,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:31:54,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:31:54,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:31:54,564 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:31:54,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:31:54,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:31:54,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:31:54,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:31:54,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:31:54,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:31:54,566 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6cc96375562d846fbf28439914184b0f5b3d70ee1197dff8e1988bf2754bc90e [2024-10-11 02:31:54,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:31:54,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:31:54,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:31:54,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:31:54,880 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:31:54,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product27.cil.c [2024-10-11 02:31:56,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:31:56,688 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:31:56,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product27.cil.c [2024-10-11 02:31:56,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0f44f2125/b05ec23f1f934d2c9d30c10f2a6ecae4/FLAGa10e7a53a [2024-10-11 02:31:56,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0f44f2125/b05ec23f1f934d2c9d30c10f2a6ecae4 [2024-10-11 02:31:56,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:31:56,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:31:56,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:31:56,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:31:56,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:31:56,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:31:56" (1/1) ... [2024-10-11 02:31:56,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c5fa4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:56, skipping insertion in model container [2024-10-11 02:31:56,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:31:56" (1/1) ... [2024-10-11 02:31:56,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:31:57,001 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product27.cil.c[1546,1559] [2024-10-11 02:31:57,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:31:57,413 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:31:57,423 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2024-10-11 02:31:57,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [57] [2024-10-11 02:31:57,426 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1620] [2024-10-11 02:31:57,426 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1975] [2024-10-11 02:31:57,426 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2066] [2024-10-11 02:31:57,427 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2432] [2024-10-11 02:31:57,427 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2467] [2024-10-11 02:31:57,427 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [2481] [2024-10-11 02:31:57,427 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2517] [2024-10-11 02:31:57,427 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2635] [2024-10-11 02:31:57,432 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product27.cil.c[1546,1559] [2024-10-11 02:31:57,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:31:57,607 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:31:57,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:57 WrapperNode [2024-10-11 02:31:57,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:31:57,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:31:57,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:31:57,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:31:57,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:57" (1/1) ... [2024-10-11 02:31:57,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:57" (1/1) ... [2024-10-11 02:31:57,692 INFO L138 Inliner]: procedures = 92, calls = 335, calls flagged for inlining = 28, calls inlined = 25, statements flattened = 1094 [2024-10-11 02:31:57,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:31:57,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:31:57,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:31:57,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:31:57,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:57" (1/1) ... [2024-10-11 02:31:57,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:57" (1/1) ... [2024-10-11 02:31:57,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:57" (1/1) ... [2024-10-11 02:31:57,750 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-11 02:31:57,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:57" (1/1) ... [2024-10-11 02:31:57,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:57" (1/1) ... [2024-10-11 02:31:57,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:57" (1/1) ... [2024-10-11 02:31:57,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:57" (1/1) ... [2024-10-11 02:31:57,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:57" (1/1) ... [2024-10-11 02:31:57,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:57" (1/1) ... [2024-10-11 02:31:57,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:31:57,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:31:57,834 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:31:57,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:31:57,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:57" (1/1) ... [2024-10-11 02:31:57,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:31:57,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:31:57,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:31:57,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:31:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:31:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:31:58,020 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:31:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-11 02:31:58,020 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-11 02:31:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:31:58,020 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:31:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-11 02:31:58,021 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-11 02:31:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:31:58,022 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:31:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-11 02:31:58,022 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-11 02:31:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:31:58,023 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:31:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:31:58,024 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:31:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:31:58,024 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:31:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:31:58,024 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:31:58,024 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:31:58,025 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:31:58,026 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:31:58,026 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:31:58,026 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-11 02:31:58,026 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-11 02:31:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:31:58,027 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:31:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-10-11 02:31:58,027 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-10-11 02:31:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:31:58,027 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:31:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:31:58,028 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:31:58,028 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:31:58,028 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:31:58,029 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:31:58,029 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:31:58,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:31:58,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:31:58,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:31:58,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:31:58,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:31:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:31:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:31:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:31:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:31:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:31:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:31:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:31:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:31:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:31:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:31:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:31:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:31:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:31:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:31:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:31:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:31:58,031 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:31:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:31:58,031 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:31:58,032 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:31:58,032 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:31:58,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:31:58,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:31:58,032 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:31:58,032 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:31:58,255 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:31:58,261 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:31:59,454 INFO L? ?]: Removed 452 outVars from TransFormulas that were not future-live. [2024-10-11 02:31:59,455 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:31:59,533 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:31:59,533 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:31:59,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:31:59 BoogieIcfgContainer [2024-10-11 02:31:59,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:31:59,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:31:59,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:31:59,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:31:59,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:31:56" (1/3) ... [2024-10-11 02:31:59,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7a853f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:31:59, skipping insertion in model container [2024-10-11 02:31:59,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:57" (2/3) ... [2024-10-11 02:31:59,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7a853f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:31:59, skipping insertion in model container [2024-10-11 02:31:59,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:31:59" (3/3) ... [2024-10-11 02:31:59,549 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product27.cil.c [2024-10-11 02:31:59,567 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:31:59,568 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:31:59,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:31:59,676 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;@1f53a42a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:31:59,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:31:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 519 states, 401 states have (on average 1.71571072319202) internal successors, (688), 417 states have internal predecessors, (688), 93 states have call successors, (93), 23 states have call predecessors, (93), 23 states have return successors, (93), 91 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-11 02:31:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 02:31:59,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:31:59,714 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:31:59,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:31:59,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:31:59,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2100219171, now seen corresponding path program 1 times [2024-10-11 02:31:59,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:31:59,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012161052] [2024-10-11 02:31:59,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:31:59,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:31:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:00,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:00,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:00,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:32:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:00,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:32:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:00,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:00,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:32:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:00,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:32:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:00,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:00,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:00,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:00,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:32:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:00,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:32:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:00,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:00,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:32:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:00,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:00,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012161052] [2024-10-11 02:32:00,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012161052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:00,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:00,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:00,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290872104] [2024-10-11 02:32:00,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:00,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:00,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:00,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:00,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:00,715 INFO L87 Difference]: Start difference. First operand has 519 states, 401 states have (on average 1.71571072319202) internal successors, (688), 417 states have internal predecessors, (688), 93 states have call successors, (93), 23 states have call predecessors, (93), 23 states have return successors, (93), 91 states have call predecessors, (93), 93 states have call successors, (93) Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:05,557 INFO L93 Difference]: Finished difference Result 1225 states and 2094 transitions. [2024-10-11 02:32:05,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:32:05,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 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 89 [2024-10-11 02:32:05,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:05,590 INFO L225 Difference]: With dead ends: 1225 [2024-10-11 02:32:05,591 INFO L226 Difference]: Without dead ends: 700 [2024-10-11 02:32:05,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:32:05,609 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 1313 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:05,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 1098 Invalid, 2862 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [375 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-11 02:32:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-11 02:32:05,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 518. [2024-10-11 02:32:05,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 401 states have (on average 1.6982543640897756) internal successors, (681), 416 states have internal predecessors, (681), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 02:32:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 866 transitions. [2024-10-11 02:32:05,821 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 866 transitions. Word has length 89 [2024-10-11 02:32:05,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:05,822 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 866 transitions. [2024-10-11 02:32:05,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 866 transitions. [2024-10-11 02:32:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 02:32:05,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:05,831 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:32:05,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:32:05,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:05,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:05,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1766358676, now seen corresponding path program 1 times [2024-10-11 02:32:05,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:05,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911533976] [2024-10-11 02:32:05,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:05,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:32:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:32:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:32:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:32:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:32:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:32:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:06,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:06,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911533976] [2024-10-11 02:32:06,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911533976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:06,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:06,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:06,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645207] [2024-10-11 02:32:06,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:06,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:06,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:06,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:06,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:06,256 INFO L87 Difference]: Start difference. First operand 518 states and 866 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:10,129 INFO L93 Difference]: Finished difference Result 1206 states and 2028 transitions. [2024-10-11 02:32:10,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:32:10,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 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 90 [2024-10-11 02:32:10,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:10,141 INFO L225 Difference]: With dead ends: 1206 [2024-10-11 02:32:10,141 INFO L226 Difference]: Without dead ends: 700 [2024-10-11 02:32:10,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:10,148 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1313 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:10,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 997 Invalid, 2834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 2457 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 02:32:10,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-11 02:32:10,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 518. [2024-10-11 02:32:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 401 states have (on average 1.6957605985037407) internal successors, (680), 416 states have internal predecessors, (680), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 02:32:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 865 transitions. [2024-10-11 02:32:10,297 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 865 transitions. Word has length 90 [2024-10-11 02:32:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:10,298 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 865 transitions. [2024-10-11 02:32:10,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 865 transitions. [2024-10-11 02:32:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 02:32:10,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:10,304 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:32:10,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:32:10,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:10,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:10,305 INFO L85 PathProgramCache]: Analyzing trace with hash -274067263, now seen corresponding path program 1 times [2024-10-11 02:32:10,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:10,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091365132] [2024-10-11 02:32:10,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:10,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:32:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:32:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:32:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:32:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:32:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:32:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:32:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:10,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:10,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091365132] [2024-10-11 02:32:10,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091365132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:10,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:10,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:10,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827476020] [2024-10-11 02:32:10,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:10,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:10,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:10,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:10,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:10,676 INFO L87 Difference]: Start difference. First operand 518 states and 865 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:14,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:14,167 INFO L93 Difference]: Finished difference Result 1206 states and 2027 transitions. [2024-10-11 02:32:14,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:32:14,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 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 91 [2024-10-11 02:32:14,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:14,173 INFO L225 Difference]: With dead ends: 1206 [2024-10-11 02:32:14,173 INFO L226 Difference]: Without dead ends: 700 [2024-10-11 02:32:14,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:14,177 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1299 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:14,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 1040 Invalid, 2837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 2462 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 02:32:14,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-11 02:32:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 518. [2024-10-11 02:32:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 401 states have (on average 1.6932668329177056) internal successors, (679), 416 states have internal predecessors, (679), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 02:32:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 864 transitions. [2024-10-11 02:32:14,277 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 864 transitions. Word has length 91 [2024-10-11 02:32:14,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:14,278 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 864 transitions. [2024-10-11 02:32:14,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 864 transitions. [2024-10-11 02:32:14,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 02:32:14,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:14,281 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:32:14,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:32:14,281 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:14,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:14,282 INFO L85 PathProgramCache]: Analyzing trace with hash -748016840, now seen corresponding path program 1 times [2024-10-11 02:32:14,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:14,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765645733] [2024-10-11 02:32:14,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:14,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:32:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:32:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:32:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 02:32:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:32:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:32:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:32:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:14,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:14,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765645733] [2024-10-11 02:32:14,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765645733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:14,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:14,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:14,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302899388] [2024-10-11 02:32:14,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:14,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:14,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:14,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:14,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:14,678 INFO L87 Difference]: Start difference. First operand 518 states and 864 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:17,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:17,777 INFO L93 Difference]: Finished difference Result 1206 states and 2026 transitions. [2024-10-11 02:32:17,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:32:17,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 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 92 [2024-10-11 02:32:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:17,784 INFO L225 Difference]: With dead ends: 1206 [2024-10-11 02:32:17,784 INFO L226 Difference]: Without dead ends: 700 [2024-10-11 02:32:17,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:17,789 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 1310 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:17,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1357 Valid, 991 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 2443 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 02:32:17,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-11 02:32:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 518. [2024-10-11 02:32:17,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 401 states have (on average 1.6907730673316708) internal successors, (678), 416 states have internal predecessors, (678), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 02:32:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 863 transitions. [2024-10-11 02:32:17,916 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 863 transitions. Word has length 92 [2024-10-11 02:32:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:17,916 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 863 transitions. [2024-10-11 02:32:17,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 863 transitions. [2024-10-11 02:32:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 02:32:17,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:17,924 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:32:17,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:32:17,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:17,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:17,925 INFO L85 PathProgramCache]: Analyzing trace with hash 94160549, now seen corresponding path program 1 times [2024-10-11 02:32:17,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:17,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482891786] [2024-10-11 02:32:17,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:17,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:32:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:32:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:32:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:32:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:32:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:32:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:32:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:18,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482891786] [2024-10-11 02:32:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482891786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:18,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:18,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:18,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552351645] [2024-10-11 02:32:18,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:18,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:18,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:18,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:18,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:18,303 INFO L87 Difference]: Start difference. First operand 518 states and 863 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:21,479 INFO L93 Difference]: Finished difference Result 1206 states and 2025 transitions. [2024-10-11 02:32:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:32:21,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 4 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 93 [2024-10-11 02:32:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:21,484 INFO L225 Difference]: With dead ends: 1206 [2024-10-11 02:32:21,484 INFO L226 Difference]: Without dead ends: 700 [2024-10-11 02:32:21,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:21,488 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 1297 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 2446 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 2824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 2446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:21,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 1028 Invalid, 2824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 2446 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 02:32:21,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-11 02:32:21,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 518. [2024-10-11 02:32:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 401 states have (on average 1.688279301745636) internal successors, (677), 416 states have internal predecessors, (677), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 02:32:21,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 862 transitions. [2024-10-11 02:32:21,573 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 862 transitions. Word has length 93 [2024-10-11 02:32:21,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:21,574 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 862 transitions. [2024-10-11 02:32:21,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:21,574 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 862 transitions. [2024-10-11 02:32:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 02:32:21,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:21,577 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:32:21,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:32:21,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:21,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:21,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1213399076, now seen corresponding path program 1 times [2024-10-11 02:32:21,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:21,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228206871] [2024-10-11 02:32:21,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:21,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:32:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 02:32:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:32:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:32:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:32:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:22,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:22,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:32:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:22,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:22,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228206871] [2024-10-11 02:32:22,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228206871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:22,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:22,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:32:22,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446580693] [2024-10-11 02:32:22,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:22,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:32:22,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:22,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:32:22,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:22,022 INFO L87 Difference]: Start difference. First operand 518 states and 862 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:32:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:26,641 INFO L93 Difference]: Finished difference Result 1226 states and 2059 transitions. [2024-10-11 02:32:26,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 02:32:26,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 94 [2024-10-11 02:32:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:26,647 INFO L225 Difference]: With dead ends: 1226 [2024-10-11 02:32:26,648 INFO L226 Difference]: Without dead ends: 724 [2024-10-11 02:32:26,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-10-11 02:32:26,651 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 1401 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 4771 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 5152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 4771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:26,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 1905 Invalid, 5152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 4771 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 02:32:26,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-10-11 02:32:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 530. [2024-10-11 02:32:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 410 states have (on average 1.6853658536585365) internal successors, (691), 427 states have internal predecessors, (691), 94 states have call successors, (94), 24 states have call predecessors, (94), 25 states have return successors, (96), 91 states have call predecessors, (96), 93 states have call successors, (96) [2024-10-11 02:32:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 881 transitions. [2024-10-11 02:32:26,772 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 881 transitions. Word has length 94 [2024-10-11 02:32:26,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:26,773 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 881 transitions. [2024-10-11 02:32:26,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:32:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 881 transitions. [2024-10-11 02:32:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 02:32:26,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:26,779 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:32:26,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:32:26,779 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:26,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1596512669, now seen corresponding path program 1 times [2024-10-11 02:32:26,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:26,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972643889] [2024-10-11 02:32:26,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:26,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:26,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:26,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:26,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:32:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 02:32:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:32:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:32:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:32:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:32:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:27,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:27,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972643889] [2024-10-11 02:32:27,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972643889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:27,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:27,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:27,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683300832] [2024-10-11 02:32:27,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:27,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:27,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:27,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:27,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:27,066 INFO L87 Difference]: Start difference. First operand 530 states and 881 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:30,328 INFO L93 Difference]: Finished difference Result 1277 states and 2147 transitions. [2024-10-11 02:32:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:32:30,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (13), 4 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 94 [2024-10-11 02:32:30,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:30,333 INFO L225 Difference]: With dead ends: 1277 [2024-10-11 02:32:30,333 INFO L226 Difference]: Without dead ends: 767 [2024-10-11 02:32:30,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:30,337 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 1378 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 2470 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 2856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 2470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:30,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1425 Valid, 1023 Invalid, 2856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 2470 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 02:32:30,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2024-10-11 02:32:30,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 549. [2024-10-11 02:32:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 428 states have (on average 1.6799065420560748) internal successors, (719), 445 states have internal predecessors, (719), 94 states have call successors, (94), 25 states have call predecessors, (94), 26 states have return successors, (95), 91 states have call predecessors, (95), 93 states have call successors, (95) [2024-10-11 02:32:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 908 transitions. [2024-10-11 02:32:30,441 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 908 transitions. Word has length 94 [2024-10-11 02:32:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:30,441 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 908 transitions. [2024-10-11 02:32:30,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 908 transitions. [2024-10-11 02:32:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 02:32:30,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:30,444 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:32:30,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:32:30,444 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:30,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:30,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2071023501, now seen corresponding path program 1 times [2024-10-11 02:32:30,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:30,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492953030] [2024-10-11 02:32:30,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:30,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:32:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:32:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:32:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:32:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:32:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:32:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:30,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:30,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492953030] [2024-10-11 02:32:30,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492953030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:30,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:30,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:30,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792102798] [2024-10-11 02:32:30,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:30,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:30,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:30,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:30,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:30,740 INFO L87 Difference]: Start difference. First operand 549 states and 908 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:33,510 INFO L93 Difference]: Finished difference Result 1252 states and 2082 transitions. [2024-10-11 02:32:33,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:32:33,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (13), 4 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 95 [2024-10-11 02:32:33,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:33,515 INFO L225 Difference]: With dead ends: 1252 [2024-10-11 02:32:33,515 INFO L226 Difference]: Without dead ends: 759 [2024-10-11 02:32:33,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:32:33,518 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1362 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:33,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 996 Invalid, 2834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 02:32:33,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2024-10-11 02:32:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 549. [2024-10-11 02:32:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 428 states have (on average 1.6682242990654206) internal successors, (714), 445 states have internal predecessors, (714), 94 states have call successors, (94), 25 states have call predecessors, (94), 26 states have return successors, (95), 91 states have call predecessors, (95), 93 states have call successors, (95) [2024-10-11 02:32:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 903 transitions. [2024-10-11 02:32:33,617 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 903 transitions. Word has length 95 [2024-10-11 02:32:33,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:33,617 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 903 transitions. [2024-10-11 02:32:33,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 903 transitions. [2024-10-11 02:32:33,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:32:33,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:33,621 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:32:33,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:32:33,621 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:33,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:33,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1448580920, now seen corresponding path program 1 times [2024-10-11 02:32:33,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:33,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720444030] [2024-10-11 02:32:33,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:33,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:32:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:32:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:32:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:32:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:32:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:33,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:33,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720444030] [2024-10-11 02:32:33,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720444030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:33,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:33,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:33,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706374436] [2024-10-11 02:32:33,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:33,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:33,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:33,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:33,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:33,926 INFO L87 Difference]: Start difference. First operand 549 states and 903 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:36,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:36,863 INFO L93 Difference]: Finished difference Result 1252 states and 2077 transitions. [2024-10-11 02:32:36,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:32:36,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 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 96 [2024-10-11 02:32:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:36,868 INFO L225 Difference]: With dead ends: 1252 [2024-10-11 02:32:36,868 INFO L226 Difference]: Without dead ends: 759 [2024-10-11 02:32:36,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:32:36,871 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 1342 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:36,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1389 Valid, 1041 Invalid, 2818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 02:32:36,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2024-10-11 02:32:36,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 549. [2024-10-11 02:32:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 428 states have (on average 1.6565420560747663) internal successors, (709), 445 states have internal predecessors, (709), 94 states have call successors, (94), 25 states have call predecessors, (94), 26 states have return successors, (95), 91 states have call predecessors, (95), 93 states have call successors, (95) [2024-10-11 02:32:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 898 transitions. [2024-10-11 02:32:36,975 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 898 transitions. Word has length 96 [2024-10-11 02:32:36,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:36,975 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 898 transitions. [2024-10-11 02:32:36,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:36,976 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 898 transitions. [2024-10-11 02:32:36,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 02:32:36,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:36,978 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:32:36,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:32:36,979 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:36,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:36,979 INFO L85 PathProgramCache]: Analyzing trace with hash -493119794, now seen corresponding path program 1 times [2024-10-11 02:32:36,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:36,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908434326] [2024-10-11 02:32:36,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:36,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:32:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:32:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:32:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:32:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:32:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:32:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:37,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:37,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908434326] [2024-10-11 02:32:37,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908434326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:37,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:37,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:32:37,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754560635] [2024-10-11 02:32:37,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:37,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:32:37,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:37,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:32:37,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:37,341 INFO L87 Difference]: Start difference. First operand 549 states and 898 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:32:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:41,477 INFO L93 Difference]: Finished difference Result 1232 states and 2038 transitions. [2024-10-11 02:32:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 02:32:41,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (13), 4 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 97 [2024-10-11 02:32:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:41,482 INFO L225 Difference]: With dead ends: 1232 [2024-10-11 02:32:41,482 INFO L226 Difference]: Without dead ends: 753 [2024-10-11 02:32:41,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-10-11 02:32:41,485 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 1329 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 4626 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 5007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 4626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:41,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1982 Invalid, 5007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 4626 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 02:32:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-10-11 02:32:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 551. [2024-10-11 02:32:41,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 430 states have (on average 1.6511627906976745) internal successors, (710), 447 states have internal predecessors, (710), 94 states have call successors, (94), 25 states have call predecessors, (94), 26 states have return successors, (95), 91 states have call predecessors, (95), 93 states have call successors, (95) [2024-10-11 02:32:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 899 transitions. [2024-10-11 02:32:41,590 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 899 transitions. Word has length 97 [2024-10-11 02:32:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:41,590 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 899 transitions. [2024-10-11 02:32:41,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:32:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 899 transitions. [2024-10-11 02:32:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 02:32:41,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:41,593 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:32:41,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:32:41,594 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:41,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:41,596 INFO L85 PathProgramCache]: Analyzing trace with hash 136276974, now seen corresponding path program 1 times [2024-10-11 02:32:41,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:41,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403061140] [2024-10-11 02:32:41,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:41,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:32:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:32:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:32:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:32:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:32:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:32:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:41,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:41,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403061140] [2024-10-11 02:32:41,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403061140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:41,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:41,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:41,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395033369] [2024-10-11 02:32:41,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:41,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:41,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:41,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:41,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:41,858 INFO L87 Difference]: Start difference. First operand 551 states and 899 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:44,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:44,635 INFO L93 Difference]: Finished difference Result 1256 states and 2071 transitions. [2024-10-11 02:32:44,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:32:44,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (13), 4 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 97 [2024-10-11 02:32:44,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:44,640 INFO L225 Difference]: With dead ends: 1256 [2024-10-11 02:32:44,640 INFO L226 Difference]: Without dead ends: 761 [2024-10-11 02:32:44,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:32:44,642 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 1334 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 2429 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 2429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:44,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 1051 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 2429 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 02:32:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-10-11 02:32:44,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 551. [2024-10-11 02:32:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 430 states have (on average 1.6395348837209303) internal successors, (705), 447 states have internal predecessors, (705), 94 states have call successors, (94), 25 states have call predecessors, (94), 26 states have return successors, (95), 91 states have call predecessors, (95), 93 states have call successors, (95) [2024-10-11 02:32:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 894 transitions. [2024-10-11 02:32:44,740 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 894 transitions. Word has length 97 [2024-10-11 02:32:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:44,740 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 894 transitions. [2024-10-11 02:32:44,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 894 transitions. [2024-10-11 02:32:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 02:32:44,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:44,744 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:32:44,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:32:44,744 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:44,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash 435002933, now seen corresponding path program 1 times [2024-10-11 02:32:44,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:44,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247333452] [2024-10-11 02:32:44,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:44,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:32:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:32:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:32:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:32:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:32:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:32:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:45,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:45,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247333452] [2024-10-11 02:32:45,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247333452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:45,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:45,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:32:45,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362406702] [2024-10-11 02:32:45,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:45,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:32:45,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:45,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:32:45,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:45,097 INFO L87 Difference]: Start difference. First operand 551 states and 894 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:32:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:49,042 INFO L93 Difference]: Finished difference Result 1245 states and 2045 transitions. [2024-10-11 02:32:49,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 02:32:49,043 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (13), 4 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 98 [2024-10-11 02:32:49,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:49,047 INFO L225 Difference]: With dead ends: 1245 [2024-10-11 02:32:49,048 INFO L226 Difference]: Without dead ends: 762 [2024-10-11 02:32:49,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-10-11 02:32:49,050 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 1338 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 4567 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 1875 SdHoareTripleChecker+Invalid, 4953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 4567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:49,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 1875 Invalid, 4953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 4567 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 02:32:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-10-11 02:32:49,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 557. [2024-10-11 02:32:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 436 states have (on average 1.628440366972477) internal successors, (710), 453 states have internal predecessors, (710), 94 states have call successors, (94), 25 states have call predecessors, (94), 26 states have return successors, (95), 91 states have call predecessors, (95), 93 states have call successors, (95) [2024-10-11 02:32:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 899 transitions. [2024-10-11 02:32:49,158 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 899 transitions. Word has length 98 [2024-10-11 02:32:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:49,158 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 899 transitions. [2024-10-11 02:32:49,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:32:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 899 transitions. [2024-10-11 02:32:49,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 02:32:49,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:49,161 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:32:49,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:32:49,162 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:49,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:49,162 INFO L85 PathProgramCache]: Analyzing trace with hash -641330989, now seen corresponding path program 1 times [2024-10-11 02:32:49,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:49,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188121622] [2024-10-11 02:32:49,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:49,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:32:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:32:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:32:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:32:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:32:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:32:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:49,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:49,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188121622] [2024-10-11 02:32:49,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188121622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:49,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:49,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:49,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764937189] [2024-10-11 02:32:49,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:49,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:49,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:49,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:49,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:49,425 INFO L87 Difference]: Start difference. First operand 557 states and 899 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:52,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:52,316 INFO L93 Difference]: Finished difference Result 1271 states and 2076 transitions. [2024-10-11 02:32:52,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:32:52,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 4 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 98 [2024-10-11 02:32:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:52,322 INFO L225 Difference]: With dead ends: 1271 [2024-10-11 02:32:52,322 INFO L226 Difference]: Without dead ends: 770 [2024-10-11 02:32:52,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:32:52,325 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 1336 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:52,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 1011 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 02:32:52,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-10-11 02:32:52,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 557. [2024-10-11 02:32:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 436 states have (on average 1.6169724770642202) internal successors, (705), 453 states have internal predecessors, (705), 94 states have call successors, (94), 25 states have call predecessors, (94), 26 states have return successors, (95), 91 states have call predecessors, (95), 93 states have call successors, (95) [2024-10-11 02:32:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 894 transitions. [2024-10-11 02:32:52,424 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 894 transitions. Word has length 98 [2024-10-11 02:32:52,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:52,424 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 894 transitions. [2024-10-11 02:32:52,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 894 transitions. [2024-10-11 02:32:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 02:32:52,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:52,427 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:32:52,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:32:52,428 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:52,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:52,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1360093513, now seen corresponding path program 1 times [2024-10-11 02:32:52,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:52,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485579636] [2024-10-11 02:32:52,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:52,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:52,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:52,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:52,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:32:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:52,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:52,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:32:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:52,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:32:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:52,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:52,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:52,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:32:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:52,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:32:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:52,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:52,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:32:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:52,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:52,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485579636] [2024-10-11 02:32:52,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485579636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:52,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:52,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:52,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015007903] [2024-10-11 02:32:52,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:52,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:52,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:52,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:52,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:52,720 INFO L87 Difference]: Start difference. First operand 557 states and 894 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:55,708 INFO L93 Difference]: Finished difference Result 1256 states and 2048 transitions. [2024-10-11 02:32:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:32:55,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-10-11 02:32:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:55,713 INFO L225 Difference]: With dead ends: 1256 [2024-10-11 02:32:55,713 INFO L226 Difference]: Without dead ends: 770 [2024-10-11 02:32:55,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:32:55,716 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1322 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 2699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:55,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1369 Valid, 1012 Invalid, 2699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 02:32:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-10-11 02:32:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 565. [2024-10-11 02:32:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 444 states have (on average 1.6036036036036037) internal successors, (712), 461 states have internal predecessors, (712), 94 states have call successors, (94), 25 states have call predecessors, (94), 26 states have return successors, (95), 91 states have call predecessors, (95), 93 states have call successors, (95) [2024-10-11 02:32:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 901 transitions. [2024-10-11 02:32:55,823 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 901 transitions. Word has length 99 [2024-10-11 02:32:55,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:55,823 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 901 transitions. [2024-10-11 02:32:55,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 901 transitions. [2024-10-11 02:32:55,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 02:32:55,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:55,826 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:32:55,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:32:55,827 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:55,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:55,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2023232663, now seen corresponding path program 1 times [2024-10-11 02:32:55,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:55,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082373735] [2024-10-11 02:32:55,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:55,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:32:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:32:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:32:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:32:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:32:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:32:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:56,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:56,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082373735] [2024-10-11 02:32:56,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082373735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:56,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:56,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:56,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304992750] [2024-10-11 02:32:56,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:56,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:56,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:56,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:56,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:56,100 INFO L87 Difference]: Start difference. First operand 565 states and 901 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:59,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:59,034 INFO L93 Difference]: Finished difference Result 1315 states and 2116 transitions. [2024-10-11 02:32:59,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:32:59,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 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 99 [2024-10-11 02:32:59,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:59,040 INFO L225 Difference]: With dead ends: 1315 [2024-10-11 02:32:59,054 INFO L226 Difference]: Without dead ends: 744 [2024-10-11 02:32:59,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:32:59,056 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 1266 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 2747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:59,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 1058 Invalid, 2747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 02:32:59,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2024-10-11 02:32:59,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 547. [2024-10-11 02:32:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 429 states have (on average 1.6083916083916083) internal successors, (690), 444 states have internal predecessors, (690), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 02:32:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 875 transitions. [2024-10-11 02:32:59,163 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 875 transitions. Word has length 99 [2024-10-11 02:32:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:59,164 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 875 transitions. [2024-10-11 02:32:59,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 875 transitions. [2024-10-11 02:32:59,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 02:32:59,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:59,166 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:32:59,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:32:59,167 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:59,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:59,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2103779760, now seen corresponding path program 1 times [2024-10-11 02:32:59,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:59,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180485778] [2024-10-11 02:32:59,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:59,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:32:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 02:32:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:32:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:32:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:32:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:32:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:59,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:59,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180485778] [2024-10-11 02:32:59,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180485778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:59,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:59,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:59,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655383089] [2024-10-11 02:32:59,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:59,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:59,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:59,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:59,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:59,457 INFO L87 Difference]: Start difference. First operand 547 states and 875 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:33:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:33:02,139 INFO L93 Difference]: Finished difference Result 1247 states and 2023 transitions. [2024-10-11 02:33:02,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:33:02,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-10-11 02:33:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:33:02,143 INFO L225 Difference]: With dead ends: 1247 [2024-10-11 02:33:02,143 INFO L226 Difference]: Without dead ends: 759 [2024-10-11 02:33:02,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:33:02,145 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 1311 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:33:02,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 975 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 02:33:02,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2024-10-11 02:33:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 557. [2024-10-11 02:33:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 439 states have (on average 1.5945330296127562) internal successors, (700), 454 states have internal predecessors, (700), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 02:33:02,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 885 transitions. [2024-10-11 02:33:02,249 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 885 transitions. Word has length 100 [2024-10-11 02:33:02,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:33:02,250 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 885 transitions. [2024-10-11 02:33:02,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:33:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 885 transitions. [2024-10-11 02:33:02,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 02:33:02,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:33:02,253 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:33:02,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:33:02,253 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:33:02,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:33:02,253 INFO L85 PathProgramCache]: Analyzing trace with hash -335035468, now seen corresponding path program 1 times [2024-10-11 02:33:02,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:33:02,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481160662] [2024-10-11 02:33:02,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:02,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:33:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:33:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:33:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:33:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:33:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:33:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:33:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:33:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:33:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:33:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 02:33:02,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:33:02,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481160662] [2024-10-11 02:33:02,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481160662] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:33:02,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985983903] [2024-10-11 02:33:02,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:02,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:33:02,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:33:02,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:33:02,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:33:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:33:02,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:33:02,837 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 02:33:02,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:33:02,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985983903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:33:02,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:33:02,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:33:02,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048297124] [2024-10-11 02:33:02,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:33:02,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:33:02,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:33:02,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:33:02,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:33:02,842 INFO L87 Difference]: Start difference. First operand 557 states and 885 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:33:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:33:03,060 INFO L93 Difference]: Finished difference Result 1526 states and 2500 transitions. [2024-10-11 02:33:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:33:03,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2024-10-11 02:33:03,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:33:03,066 INFO L225 Difference]: With dead ends: 1526 [2024-10-11 02:33:03,066 INFO L226 Difference]: Without dead ends: 1039 [2024-10-11 02:33:03,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:33:03,068 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 827 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:33:03,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1639 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:33:03,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2024-10-11 02:33:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1032. [2024-10-11 02:33:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 808 states have (on average 1.620049504950495) internal successors, (1309), 836 states have internal predecessors, (1309), 178 states have call successors, (178), 46 states have call predecessors, (178), 45 states have return successors, (188), 175 states have call predecessors, (188), 176 states have call successors, (188) [2024-10-11 02:33:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1675 transitions. [2024-10-11 02:33:03,289 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1675 transitions. Word has length 101 [2024-10-11 02:33:03,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:33:03,290 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1675 transitions. [2024-10-11 02:33:03,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:33:03,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1675 transitions. [2024-10-11 02:33:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 02:33:03,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:33:03,293 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:33:03,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 02:33:03,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 02:33:03,494 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:33:03,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:33:03,494 INFO L85 PathProgramCache]: Analyzing trace with hash -553890186, now seen corresponding path program 1 times [2024-10-11 02:33:03,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:33:03,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584162185] [2024-10-11 02:33:03,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:03,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:33:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:33:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:33:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:33:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:33:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:33:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:33:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:33:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:33:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:33:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 02:33:03,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:33:03,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584162185] [2024-10-11 02:33:03,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584162185] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:33:03,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736515738] [2024-10-11 02:33:03,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:03,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:33:03,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:33:03,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:33:03,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:33:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:33:04,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:33:04,175 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:33:04,176 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:33:04,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736515738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:33:04,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:33:04,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-11 02:33:04,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626037432] [2024-10-11 02:33:04,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:33:04,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:33:04,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:33:04,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:33:04,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:33:04,179 INFO L87 Difference]: Start difference. First operand 1032 states and 1675 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:33:04,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:33:04,857 INFO L93 Difference]: Finished difference Result 2010 states and 3341 transitions. [2024-10-11 02:33:04,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:33:04,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 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 101 [2024-10-11 02:33:04,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:33:04,863 INFO L225 Difference]: With dead ends: 2010 [2024-10-11 02:33:04,864 INFO L226 Difference]: Without dead ends: 1048 [2024-10-11 02:33:04,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:33:04,869 INFO L432 NwaCegarLoop]: 798 mSDtfsCounter, 795 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:33:04,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 2032 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 02:33:04,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2024-10-11 02:33:05,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1048. [2024-10-11 02:33:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 822 states have (on average 1.621654501216545) internal successors, (1333), 850 states have internal predecessors, (1333), 178 states have call successors, (178), 48 states have call predecessors, (178), 47 states have return successors, (190), 175 states have call predecessors, (190), 176 states have call successors, (190) [2024-10-11 02:33:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1701 transitions. [2024-10-11 02:33:05,037 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1701 transitions. Word has length 101 [2024-10-11 02:33:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:33:05,037 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1701 transitions. [2024-10-11 02:33:05,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:33:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1701 transitions. [2024-10-11 02:33:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 02:33:05,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:33:05,040 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:33:05,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:33:05,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 02:33:05,241 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:33:05,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:33:05,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1632537885, now seen corresponding path program 1 times [2024-10-11 02:33:05,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:33:05,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416366831] [2024-10-11 02:33:05,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:05,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:33:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:33:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:33:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:33:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:33:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:33:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:33:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:33:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:33:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:33:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 02:33:05,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:33:05,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416366831] [2024-10-11 02:33:05,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416366831] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:33:05,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840519544] [2024-10-11 02:33:05,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:05,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:33:05,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:33:05,511 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:33:05,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:33:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:33:05,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:33:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 02:33:05,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:33:05,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840519544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:33:05,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:33:05,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-11 02:33:05,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686304647] [2024-10-11 02:33:05,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:33:05,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:33:05,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:33:05,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:33:05,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:33:05,856 INFO L87 Difference]: Start difference. First operand 1048 states and 1701 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:33:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:33:06,452 INFO L93 Difference]: Finished difference Result 2042 states and 3387 transitions. [2024-10-11 02:33:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:33:06,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 2 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 104 [2024-10-11 02:33:06,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:33:06,459 INFO L225 Difference]: With dead ends: 2042 [2024-10-11 02:33:06,459 INFO L226 Difference]: Without dead ends: 1064 [2024-10-11 02:33:06,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:33:06,465 INFO L432 NwaCegarLoop]: 795 mSDtfsCounter, 793 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 2029 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:33:06,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 2029 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 02:33:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2024-10-11 02:33:06,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1064. [2024-10-11 02:33:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 836 states have (on average 1.6232057416267942) internal successors, (1357), 864 states have internal predecessors, (1357), 178 states have call successors, (178), 50 states have call predecessors, (178), 49 states have return successors, (192), 175 states have call predecessors, (192), 176 states have call successors, (192) [2024-10-11 02:33:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1727 transitions. [2024-10-11 02:33:06,694 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1727 transitions. Word has length 104 [2024-10-11 02:33:06,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:33:06,695 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1727 transitions. [2024-10-11 02:33:06,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:33:06,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1727 transitions. [2024-10-11 02:33:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 02:33:06,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:33:06,698 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:33:06,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:33:06,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:33:06,899 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:33:06,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:33:06,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2119682414, now seen corresponding path program 1 times [2024-10-11 02:33:06,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:33:06,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733976641] [2024-10-11 02:33:06,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:06,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:33:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:33:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:33:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:33:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:33:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:33:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:33:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:33:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:33:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:33:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:33:07,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:33:07,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733976641] [2024-10-11 02:33:07,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733976641] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:33:07,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031752281] [2024-10-11 02:33:07,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:07,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:33:07,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:33:07,213 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:33:07,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:33:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:33:07,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:33:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 02:33:07,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:33:07,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031752281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:33:07,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:33:07,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-11 02:33:07,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616466448] [2024-10-11 02:33:07,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:33:07,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:33:07,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:33:07,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:33:07,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:33:07,570 INFO L87 Difference]: Start difference. First operand 1064 states and 1727 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:33:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:33:08,242 INFO L93 Difference]: Finished difference Result 2074 states and 3433 transitions. [2024-10-11 02:33:08,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:33:08,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 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 107 [2024-10-11 02:33:08,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:33:08,249 INFO L225 Difference]: With dead ends: 2074 [2024-10-11 02:33:08,249 INFO L226 Difference]: Without dead ends: 1080 [2024-10-11 02:33:08,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:33:08,254 INFO L432 NwaCegarLoop]: 792 mSDtfsCounter, 790 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:33:08,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 2026 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 02:33:08,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-10-11 02:33:08,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1080. [2024-10-11 02:33:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 850 states have (on average 1.6247058823529412) internal successors, (1381), 878 states have internal predecessors, (1381), 178 states have call successors, (178), 52 states have call predecessors, (178), 51 states have return successors, (194), 175 states have call predecessors, (194), 176 states have call successors, (194) [2024-10-11 02:33:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1753 transitions. [2024-10-11 02:33:08,451 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1753 transitions. Word has length 107 [2024-10-11 02:33:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:33:08,451 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1753 transitions. [2024-10-11 02:33:08,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:33:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1753 transitions. [2024-10-11 02:33:08,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 02:33:08,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:33:08,454 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 02:33:08,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 02:33:08,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:33:08,655 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:33:08,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:33:08,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1777679375, now seen corresponding path program 1 times [2024-10-11 02:33:08,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:33:08,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611710396] [2024-10-11 02:33:08,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:08,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:33:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:08,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:33:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:08,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:08,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:33:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:08,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:33:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:08,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:08,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:33:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:08,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:33:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:08,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:08,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:08,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:33:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:08,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:33:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:08,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:33:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:08,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:08,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:33:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 02:33:08,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:33:08,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611710396] [2024-10-11 02:33:08,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611710396] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:33:08,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855633002] [2024-10-11 02:33:08,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:08,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:33:08,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:33:08,976 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:33:08,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:33:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:09,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:33:09,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:33:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 02:33:09,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:33:09,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855633002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:33:09,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:33:09,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-11 02:33:09,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092091279] [2024-10-11 02:33:09,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:33:09,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:33:09,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:33:09,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:33:09,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:33:09,353 INFO L87 Difference]: Start difference. First operand 1080 states and 1753 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)