./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec14_product20.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec14_product20.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6cc861ca86011eb32ffd09a18c7045c0cb28e684d3b73d1659bc499a4213e84 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:26:27,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:26:27,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:26:27,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:26:27,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:26:27,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:26:27,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:26:27,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:26:27,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:26:27,741 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:26:27,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:26:27,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:26:27,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:26:27,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:26:27,743 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:26:27,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:26:27,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:26:27,744 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:26:27,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:26:27,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:26:27,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:26:27,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:26:27,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:26:27,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:26:27,745 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:26:27,746 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:26:27,746 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:26:27,746 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:26:27,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:26:27,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:26:27,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:26:27,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:26:27,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:26:27,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:26:27,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:26:27,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:26:27,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:26:27,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:26:27,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:26:27,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:26:27,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:26:27,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:26:27,759 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/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/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 -> f6cc861ca86011eb32ffd09a18c7045c0cb28e684d3b73d1659bc499a4213e84 [2024-11-11 20:26:28,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:26:28,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:26:28,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:26:28,046 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:26:28,046 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:26:28,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec14_product20.cil.c [2024-11-11 20:26:29,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:26:29,574 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:26:29,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product20.cil.c [2024-11-11 20:26:29,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaae9026d/51b059495af94378af0a9e262fddb0a3/FLAGe7e538b0a [2024-11-11 20:26:29,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaae9026d/51b059495af94378af0a9e262fddb0a3 [2024-11-11 20:26:29,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:26:29,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:26:29,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:26:29,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:26:29,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:26:29,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:26:29" (1/1) ... [2024-11-11 20:26:29,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa01ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:29, skipping insertion in model container [2024-11-11 20:26:29,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:26:29" (1/1) ... [2024-11-11 20:26:29,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:26:30,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product20.cil.c[69987,70000] [2024-11-11 20:26:30,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:26:30,106 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:26:30,113 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2024-11-11 20:26:30,114 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [414] [2024-11-11 20:26:30,114 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [517] [2024-11-11 20:26:30,114 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [558] [2024-11-11 20:26:30,115 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [911] [2024-11-11 20:26:30,115 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [946] [2024-11-11 20:26:30,115 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [960] [2024-11-11 20:26:30,115 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1627] [2024-11-11 20:26:30,115 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3197] [2024-11-11 20:26:30,115 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3315] [2024-11-11 20:26:30,208 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product20.cil.c[69987,70000] [2024-11-11 20:26:30,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:26:30,237 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:26:30,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:30 WrapperNode [2024-11-11 20:26:30,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:26:30,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:26:30,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:26:30,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:26:30,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:30" (1/1) ... [2024-11-11 20:26:30,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:30" (1/1) ... [2024-11-11 20:26:30,308 INFO L138 Inliner]: procedures = 93, calls = 339, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 1059 [2024-11-11 20:26:30,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:26:30,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:26:30,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:26:30,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:26:30,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:30" (1/1) ... [2024-11-11 20:26:30,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:30" (1/1) ... [2024-11-11 20:26:30,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:30" (1/1) ... [2024-11-11 20:26:30,360 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-11-11 20:26:30,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:30" (1/1) ... [2024-11-11 20:26:30,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:30" (1/1) ... [2024-11-11 20:26:30,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:30" (1/1) ... [2024-11-11 20:26:30,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:30" (1/1) ... [2024-11-11 20:26:30,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:30" (1/1) ... [2024-11-11 20:26:30,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:30" (1/1) ... [2024-11-11 20:26:30,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:26:30,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:26:30,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:26:30,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:26:30,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:30" (1/1) ... [2024-11-11 20:26:30,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:26:30,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:26:30,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:26:30,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:26:30,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:26:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-11 20:26:30,547 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-11 20:26:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-11 20:26:30,547 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-11 20:26:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2024-11-11 20:26:30,547 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2024-11-11 20:26:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-11 20:26:30,548 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-11 20:26:30,548 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-11-11 20:26:30,548 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-11-11 20:26:30,548 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-11 20:26:30,548 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-11 20:26:30,549 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-11-11 20:26:30,549 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-11-11 20:26:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-11 20:26:30,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-11 20:26:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:26:30,550 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:26:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:26:30,550 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:26:30,551 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-11-11 20:26:30,551 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-11-11 20:26:30,552 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-11 20:26:30,552 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-11 20:26:30,552 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-11 20:26:30,552 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-11 20:26:30,552 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-11 20:26:30,552 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-11 20:26:30,552 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-11-11 20:26:30,552 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-11-11 20:26:30,552 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-11 20:26:30,552 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-11 20:26:30,553 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-11 20:26:30,553 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-11 20:26:30,553 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-11 20:26:30,553 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-11 20:26:30,553 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-11 20:26:30,553 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-11 20:26:30,554 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-11 20:26:30,554 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-11 20:26:30,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:26:30,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:26:30,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:26:30,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:26:30,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-11 20:26:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-11 20:26:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-11 20:26:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-11 20:26:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-11 20:26:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-11 20:26:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-11 20:26:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-11 20:26:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-11 20:26:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-11 20:26:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-11 20:26:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-11 20:26:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-11 20:26:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-11 20:26:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-11 20:26:30,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-11 20:26:30,558 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-11 20:26:30,558 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-11 20:26:30,558 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-11 20:26:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-11 20:26:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-11 20:26:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-11 20:26:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:26:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:26:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-11 20:26:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-11 20:26:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-11-11 20:26:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-11-11 20:26:30,728 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:26:30,732 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:26:31,712 INFO L? ?]: Removed 441 outVars from TransFormulas that were not future-live. [2024-11-11 20:26:31,712 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:26:31,741 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:26:31,742 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:26:31,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:26:31 BoogieIcfgContainer [2024-11-11 20:26:31,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:26:31,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:26:31,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:26:31,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:26:31,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:26:29" (1/3) ... [2024-11-11 20:26:31,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695a2d60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:26:31, skipping insertion in model container [2024-11-11 20:26:31,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:30" (2/3) ... [2024-11-11 20:26:31,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695a2d60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:26:31, skipping insertion in model container [2024-11-11 20:26:31,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:26:31" (3/3) ... [2024-11-11 20:26:31,777 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product20.cil.c [2024-11-11 20:26:31,792 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:26:31,793 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:26:31,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:26:31,877 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;@38b326ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:26:31,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:26:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 545 states, 421 states have (on average 1.669833729216152) internal successors, (703), 439 states have internal predecessors, (703), 97 states have call successors, (97), 25 states have call predecessors, (97), 25 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-11 20:26:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 20:26:31,894 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:31,894 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:31,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:31,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:31,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1406602472, now seen corresponding path program 1 times [2024-11-11 20:26:31,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:31,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461864642] [2024-11-11 20:26:31,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:32,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:32,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:32,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:32,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:26:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:32,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:26:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:32,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:32,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 20:26:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:32,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:26:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:32,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:26:32,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:32,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461864642] [2024-11-11 20:26:32,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461864642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:32,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:32,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:26:32,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987117143] [2024-11-11 20:26:32,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:32,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:26:32,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:32,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:26:32,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:26:32,628 INFO L87 Difference]: Start difference. First operand has 545 states, 421 states have (on average 1.669833729216152) internal successors, (703), 439 states have internal predecessors, (703), 97 states have call successors, (97), 25 states have call predecessors, (97), 25 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:35,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:35,448 INFO L93 Difference]: Finished difference Result 1206 states and 2011 transitions. [2024-11-11 20:26:35,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:26:35,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2024-11-11 20:26:35,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:35,469 INFO L225 Difference]: With dead ends: 1206 [2024-11-11 20:26:35,470 INFO L226 Difference]: Without dead ends: 661 [2024-11-11 20:26:35,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:26:35,478 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 639 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:35,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1571 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 20:26:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-11 20:26:35,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 540. [2024-11-11 20:26:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 417 states have (on average 1.65947242206235) internal successors, (692), 434 states have internal predecessors, (692), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-11 20:26:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 885 transitions. [2024-11-11 20:26:35,608 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 885 transitions. Word has length 63 [2024-11-11 20:26:35,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:35,608 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 885 transitions. [2024-11-11 20:26:35,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 885 transitions. [2024-11-11 20:26:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-11 20:26:35,611 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:35,611 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:35,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:26:35,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:35,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:35,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1205862229, now seen corresponding path program 1 times [2024-11-11 20:26:35,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:35,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667493862] [2024-11-11 20:26:35,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:35,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:35,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:35,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:35,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:26:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:35,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:26:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:35,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:26:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:35,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:35,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 20:26:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:35,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:26:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:26:35,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:35,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667493862] [2024-11-11 20:26:35,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667493862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:35,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:35,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:26:35,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803384855] [2024-11-11 20:26:35,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:35,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:26:35,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:35,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:26:35,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:26:35,889 INFO L87 Difference]: Start difference. First operand 540 states and 885 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:38,140 INFO L93 Difference]: Finished difference Result 1184 states and 1955 transitions. [2024-11-11 20:26:38,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:26:38,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 64 [2024-11-11 20:26:38,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:38,145 INFO L225 Difference]: With dead ends: 1184 [2024-11-11 20:26:38,145 INFO L226 Difference]: Without dead ends: 661 [2024-11-11 20:26:38,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:26:38,148 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 632 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 1726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:38,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1528 Invalid, 1726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 20:26:38,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-11 20:26:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 540. [2024-11-11 20:26:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 417 states have (on average 1.6570743405275778) internal successors, (691), 434 states have internal predecessors, (691), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-11 20:26:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 884 transitions. [2024-11-11 20:26:38,209 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 884 transitions. Word has length 64 [2024-11-11 20:26:38,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:38,211 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 884 transitions. [2024-11-11 20:26:38,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:38,211 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 884 transitions. [2024-11-11 20:26:38,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 20:26:38,215 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:38,215 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:38,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:26:38,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:38,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:38,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1806176572, now seen corresponding path program 1 times [2024-11-11 20:26:38,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:38,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127041581] [2024-11-11 20:26:38,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:38,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:38,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:38,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:38,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:26:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:38,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:26:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:38,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:26:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:38,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:38,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:26:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:38,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:26:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:26:38,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:38,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127041581] [2024-11-11 20:26:38,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127041581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:38,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:38,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:26:38,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723144923] [2024-11-11 20:26:38,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:38,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:26:38,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:38,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:26:38,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:26:38,429 INFO L87 Difference]: Start difference. First operand 540 states and 884 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:40,592 INFO L93 Difference]: Finished difference Result 1184 states and 1954 transitions. [2024-11-11 20:26:40,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:26:40,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2024-11-11 20:26:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:40,596 INFO L225 Difference]: With dead ends: 1184 [2024-11-11 20:26:40,596 INFO L226 Difference]: Without dead ends: 661 [2024-11-11 20:26:40,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:26:40,599 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 630 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:40,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1528 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 20:26:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-11 20:26:40,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 540. [2024-11-11 20:26:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 417 states have (on average 1.6546762589928057) internal successors, (690), 434 states have internal predecessors, (690), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-11 20:26:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 883 transitions. [2024-11-11 20:26:40,646 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 883 transitions. Word has length 65 [2024-11-11 20:26:40,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:40,646 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 883 transitions. [2024-11-11 20:26:40,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 883 transitions. [2024-11-11 20:26:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 20:26:40,648 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:40,648 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:40,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:26:40,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:40,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:40,649 INFO L85 PathProgramCache]: Analyzing trace with hash -159371961, now seen corresponding path program 1 times [2024-11-11 20:26:40,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:40,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618898488] [2024-11-11 20:26:40,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:40,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:40,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:40,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:40,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:26:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:40,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:26:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:40,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:26:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:40,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:40,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 20:26:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:40,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:26:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:26:40,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:40,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618898488] [2024-11-11 20:26:40,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618898488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:40,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:40,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:26:40,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875527705] [2024-11-11 20:26:40,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:40,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:26:40,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:40,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:26:40,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:26:40,889 INFO L87 Difference]: Start difference. First operand 540 states and 883 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:42,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:42,967 INFO L93 Difference]: Finished difference Result 1184 states and 1953 transitions. [2024-11-11 20:26:42,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:26:42,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2024-11-11 20:26:42,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:42,974 INFO L225 Difference]: With dead ends: 1184 [2024-11-11 20:26:42,974 INFO L226 Difference]: Without dead ends: 661 [2024-11-11 20:26:42,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:26:42,981 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 628 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:42,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1528 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 20:26:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-11 20:26:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 540. [2024-11-11 20:26:43,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 417 states have (on average 1.6522781774580335) internal successors, (689), 434 states have internal predecessors, (689), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-11 20:26:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 882 transitions. [2024-11-11 20:26:43,048 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 882 transitions. Word has length 66 [2024-11-11 20:26:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:43,049 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 882 transitions. [2024-11-11 20:26:43,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 882 transitions. [2024-11-11 20:26:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 20:26:43,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:43,051 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:43,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:26:43,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:43,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:43,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1866323808, now seen corresponding path program 1 times [2024-11-11 20:26:43,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:43,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753165467] [2024-11-11 20:26:43,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:43,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:26:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:26:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:26:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:26:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:26:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:26:43,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:43,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753165467] [2024-11-11 20:26:43,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753165467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:43,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:43,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:26:43,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898158415] [2024-11-11 20:26:43,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:43,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:26:43,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:43,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:26:43,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:26:43,311 INFO L87 Difference]: Start difference. First operand 540 states and 882 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:45,267 INFO L93 Difference]: Finished difference Result 1184 states and 1952 transitions. [2024-11-11 20:26:45,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:26:45,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2024-11-11 20:26:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:45,272 INFO L225 Difference]: With dead ends: 1184 [2024-11-11 20:26:45,272 INFO L226 Difference]: Without dead ends: 661 [2024-11-11 20:26:45,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:26:45,274 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 626 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:45,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1528 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 20:26:45,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-11 20:26:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 540. [2024-11-11 20:26:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 417 states have (on average 1.6498800959232613) internal successors, (688), 434 states have internal predecessors, (688), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-11 20:26:45,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 881 transitions. [2024-11-11 20:26:45,324 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 881 transitions. Word has length 67 [2024-11-11 20:26:45,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:45,324 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 881 transitions. [2024-11-11 20:26:45,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:45,324 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 881 transitions. [2024-11-11 20:26:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 20:26:45,325 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:45,325 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:45,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:26:45,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:45,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:45,326 INFO L85 PathProgramCache]: Analyzing trace with hash -165543453, now seen corresponding path program 1 times [2024-11-11 20:26:45,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:45,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855253847] [2024-11-11 20:26:45,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:45,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:45,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:45,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:45,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:26:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:45,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:26:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:45,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 20:26:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:45,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:45,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:26:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:45,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:26:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:26:45,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:45,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855253847] [2024-11-11 20:26:45,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855253847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:45,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:45,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:26:45,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080430451] [2024-11-11 20:26:45,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:45,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:26:45,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:45,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:26:45,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:26:45,631 INFO L87 Difference]: Start difference. First operand 540 states and 881 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:26:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:48,491 INFO L93 Difference]: Finished difference Result 1206 states and 1988 transitions. [2024-11-11 20:26:48,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 20:26:48,492 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2024-11-11 20:26:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:48,495 INFO L225 Difference]: With dead ends: 1206 [2024-11-11 20:26:48,495 INFO L226 Difference]: Without dead ends: 687 [2024-11-11 20:26:48,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:26:48,497 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 716 mSDsluCounter, 3292 mSDsCounter, 0 mSdLazyCounter, 4254 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 3780 SdHoareTripleChecker+Invalid, 4368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 4254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:48,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 3780 Invalid, 4368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 4254 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 20:26:48,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-11 20:26:48,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 553. [2024-11-11 20:26:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 427 states have (on average 1.6463700234192038) internal successors, (703), 446 states have internal predecessors, (703), 98 states have call successors, (98), 26 states have call predecessors, (98), 27 states have return successors, (100), 94 states have call predecessors, (100), 97 states have call successors, (100) [2024-11-11 20:26:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 901 transitions. [2024-11-11 20:26:48,542 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 901 transitions. Word has length 68 [2024-11-11 20:26:48,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:48,542 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 901 transitions. [2024-11-11 20:26:48,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:26:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 901 transitions. [2024-11-11 20:26:48,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 20:26:48,544 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:48,544 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:48,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:26:48,544 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:48,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:48,544 INFO L85 PathProgramCache]: Analyzing trace with hash 603626562, now seen corresponding path program 1 times [2024-11-11 20:26:48,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:48,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771136478] [2024-11-11 20:26:48,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:48,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:48,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:48,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:48,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:26:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:48,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:26:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:48,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 20:26:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:48,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:48,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:26:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:48,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:26:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:26:48,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:48,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771136478] [2024-11-11 20:26:48,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771136478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:48,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:48,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:26:48,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005804325] [2024-11-11 20:26:48,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:48,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:26:48,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:48,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:26:48,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:26:48,731 INFO L87 Difference]: Start difference. First operand 553 states and 901 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:50,886 INFO L93 Difference]: Finished difference Result 1264 states and 2083 transitions. [2024-11-11 20:26:50,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:26:50,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2024-11-11 20:26:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:50,890 INFO L225 Difference]: With dead ends: 1264 [2024-11-11 20:26:50,890 INFO L226 Difference]: Without dead ends: 736 [2024-11-11 20:26:50,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:26:50,892 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 699 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:50,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1507 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 20:26:50,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-11 20:26:50,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 573. [2024-11-11 20:26:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 446 states have (on average 1.641255605381166) internal successors, (732), 465 states have internal predecessors, (732), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-11-11 20:26:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 929 transitions. [2024-11-11 20:26:50,940 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 929 transitions. Word has length 68 [2024-11-11 20:26:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:50,941 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 929 transitions. [2024-11-11 20:26:50,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 929 transitions. [2024-11-11 20:26:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 20:26:50,942 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:50,942 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:50,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:26:50,942 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:50,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:50,943 INFO L85 PathProgramCache]: Analyzing trace with hash 665974914, now seen corresponding path program 1 times [2024-11-11 20:26:50,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:50,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595066168] [2024-11-11 20:26:50,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:50,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:51,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:51,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:26:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:51,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:26:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:51,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:26:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:51,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:51,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:26:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:51,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:26:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:26:51,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:51,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595066168] [2024-11-11 20:26:51,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595066168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:51,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:51,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:26:51,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586363383] [2024-11-11 20:26:51,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:51,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:26:51,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:51,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:26:51,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:26:51,156 INFO L87 Difference]: Start difference. First operand 573 states and 929 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:53,126 INFO L93 Difference]: Finished difference Result 1239 states and 2018 transitions. [2024-11-11 20:26:53,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:26:53,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2024-11-11 20:26:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:53,132 INFO L225 Difference]: With dead ends: 1239 [2024-11-11 20:26:53,132 INFO L226 Difference]: Without dead ends: 727 [2024-11-11 20:26:53,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:26:53,135 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 687 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:53,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1514 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 20:26:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-11-11 20:26:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 573. [2024-11-11 20:26:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 446 states have (on average 1.6300448430493273) internal successors, (727), 465 states have internal predecessors, (727), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-11-11 20:26:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 924 transitions. [2024-11-11 20:26:53,206 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 924 transitions. Word has length 69 [2024-11-11 20:26:53,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:53,207 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 924 transitions. [2024-11-11 20:26:53,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:53,207 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 924 transitions. [2024-11-11 20:26:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 20:26:53,208 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:53,208 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:53,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:26:53,208 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:53,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1609961273, now seen corresponding path program 1 times [2024-11-11 20:26:53,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:53,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163588039] [2024-11-11 20:26:53,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:53,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:53,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:53,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:53,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:26:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:53,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:26:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:53,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 20:26:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:53,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:53,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:26:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:53,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:26:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:26:53,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:53,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163588039] [2024-11-11 20:26:53,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163588039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:53,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:53,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:26:53,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401167163] [2024-11-11 20:26:53,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:53,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:26:53,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:53,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:26:53,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:26:53,409 INFO L87 Difference]: Start difference. First operand 573 states and 924 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:55,262 INFO L93 Difference]: Finished difference Result 1239 states and 2013 transitions. [2024-11-11 20:26:55,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:26:55,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2024-11-11 20:26:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:55,266 INFO L225 Difference]: With dead ends: 1239 [2024-11-11 20:26:55,267 INFO L226 Difference]: Without dead ends: 727 [2024-11-11 20:26:55,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:26:55,269 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 686 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:55,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 1514 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1761 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 20:26:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-11-11 20:26:55,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 573. [2024-11-11 20:26:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 446 states have (on average 1.6188340807174888) internal successors, (722), 465 states have internal predecessors, (722), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-11-11 20:26:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 919 transitions. [2024-11-11 20:26:55,316 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 919 transitions. Word has length 70 [2024-11-11 20:26:55,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:55,316 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 919 transitions. [2024-11-11 20:26:55,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:55,317 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 919 transitions. [2024-11-11 20:26:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-11 20:26:55,317 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:55,318 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:55,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:26:55,318 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:55,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:55,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1558871751, now seen corresponding path program 1 times [2024-11-11 20:26:55,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:55,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061908755] [2024-11-11 20:26:55,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:55,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:55,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:55,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:55,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:26:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:55,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:26:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:55,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:26:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:55,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:55,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:26:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:55,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:26:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:26:55,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:55,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061908755] [2024-11-11 20:26:55,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061908755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:55,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:55,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:26:55,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836967554] [2024-11-11 20:26:55,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:55,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:26:55,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:55,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:26:55,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:26:55,552 INFO L87 Difference]: Start difference. First operand 573 states and 919 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:57,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:57,527 INFO L93 Difference]: Finished difference Result 1211 states and 1966 transitions. [2024-11-11 20:26:57,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:26:57,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2024-11-11 20:26:57,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:57,532 INFO L225 Difference]: With dead ends: 1211 [2024-11-11 20:26:57,532 INFO L226 Difference]: Without dead ends: 714 [2024-11-11 20:26:57,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:26:57,534 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 673 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:57,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1501 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 20:26:57,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-11-11 20:26:57,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 575. [2024-11-11 20:26:57,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 448 states have (on average 1.6138392857142858) internal successors, (723), 467 states have internal predecessors, (723), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-11-11 20:26:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 920 transitions. [2024-11-11 20:26:57,587 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 920 transitions. Word has length 71 [2024-11-11 20:26:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:57,587 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 920 transitions. [2024-11-11 20:26:57,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 920 transitions. [2024-11-11 20:26:57,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-11 20:26:57,588 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:57,589 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:57,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:26:57,589 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:57,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:57,590 INFO L85 PathProgramCache]: Analyzing trace with hash 936693159, now seen corresponding path program 1 times [2024-11-11 20:26:57,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:57,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125346469] [2024-11-11 20:26:57,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:57,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:57,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:57,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:57,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:26:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:57,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:26:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:57,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:26:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:57,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:57,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:26:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:26:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:57,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:26:57,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:57,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125346469] [2024-11-11 20:26:57,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125346469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:57,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:57,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:26:57,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926251419] [2024-11-11 20:26:57,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:57,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:26:57,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:57,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:26:57,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:26:57,778 INFO L87 Difference]: Start difference. First operand 575 states and 920 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:59,760 INFO L93 Difference]: Finished difference Result 1243 states and 2007 transitions. [2024-11-11 20:26:59,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:26:59,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2024-11-11 20:26:59,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:59,764 INFO L225 Difference]: With dead ends: 1243 [2024-11-11 20:26:59,765 INFO L226 Difference]: Without dead ends: 729 [2024-11-11 20:26:59,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:26:59,766 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 684 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:59,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1514 Invalid, 1851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 20:26:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-11-11 20:26:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 575. [2024-11-11 20:26:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 448 states have (on average 1.6026785714285714) internal successors, (718), 467 states have internal predecessors, (718), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-11-11 20:26:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 915 transitions. [2024-11-11 20:26:59,814 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 915 transitions. Word has length 71 [2024-11-11 20:26:59,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:59,814 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 915 transitions. [2024-11-11 20:26:59,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:26:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 915 transitions. [2024-11-11 20:26:59,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 20:26:59,815 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:59,815 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:59,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:26:59,816 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:59,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash 739668010, now seen corresponding path program 1 times [2024-11-11 20:26:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:59,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870640913] [2024-11-11 20:26:59,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:59,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:59,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:00,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:00,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:00,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:27:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:00,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 20:27:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:00,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:00,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:27:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:00,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:27:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:27:00,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:00,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870640913] [2024-11-11 20:27:00,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870640913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:00,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:27:00,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:27:00,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703917564] [2024-11-11 20:27:00,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:00,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:27:00,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:00,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:27:00,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:27:00,083 INFO L87 Difference]: Start difference. First operand 575 states and 915 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:27:02,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:02,761 INFO L93 Difference]: Finished difference Result 1229 states and 1978 transitions. [2024-11-11 20:27:02,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:27:02,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 72 [2024-11-11 20:27:02,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:02,765 INFO L225 Difference]: With dead ends: 1229 [2024-11-11 20:27:02,765 INFO L226 Difference]: Without dead ends: 727 [2024-11-11 20:27:02,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:27:02,767 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 671 mSDsluCounter, 2422 mSDsCounter, 0 mSdLazyCounter, 3277 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 2921 SdHoareTripleChecker+Invalid, 3386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 3277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:02,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 2921 Invalid, 3386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 3277 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 20:27:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-11-11 20:27:02,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 581. [2024-11-11 20:27:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 454 states have (on average 1.592511013215859) internal successors, (723), 473 states have internal predecessors, (723), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-11-11 20:27:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 920 transitions. [2024-11-11 20:27:02,818 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 920 transitions. Word has length 72 [2024-11-11 20:27:02,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:02,818 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 920 transitions. [2024-11-11 20:27:02,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:27:02,818 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 920 transitions. [2024-11-11 20:27:02,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 20:27:02,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:02,820 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:02,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:27:02,820 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:02,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:02,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1635165876, now seen corresponding path program 1 times [2024-11-11 20:27:02,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:02,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548999124] [2024-11-11 20:27:02,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:02,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:02,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:02,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:02,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:02,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:27:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:02,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 20:27:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:03,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:03,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:27:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:03,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:27:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:27:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548999124] [2024-11-11 20:27:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548999124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:03,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:27:03,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:27:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856386042] [2024-11-11 20:27:03,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:27:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:03,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:27:03,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:27:03,011 INFO L87 Difference]: Start difference. First operand 581 states and 920 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:27:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:04,916 INFO L93 Difference]: Finished difference Result 1258 states and 2012 transitions. [2024-11-11 20:27:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:27:04,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2024-11-11 20:27:04,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:04,920 INFO L225 Difference]: With dead ends: 1258 [2024-11-11 20:27:04,921 INFO L226 Difference]: Without dead ends: 738 [2024-11-11 20:27:04,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:27:04,922 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 682 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:04,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1514 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 20:27:04,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-11 20:27:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 581. [2024-11-11 20:27:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 454 states have (on average 1.5814977973568283) internal successors, (718), 473 states have internal predecessors, (718), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-11-11 20:27:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 915 transitions. [2024-11-11 20:27:04,980 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 915 transitions. Word has length 72 [2024-11-11 20:27:04,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:04,980 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 915 transitions. [2024-11-11 20:27:04,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:27:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 915 transitions. [2024-11-11 20:27:04,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-11 20:27:04,982 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:04,982 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:04,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:27:04,982 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:04,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:04,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1129327380, now seen corresponding path program 1 times [2024-11-11 20:27:04,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:04,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330763879] [2024-11-11 20:27:04,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:04,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:05,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:05,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:05,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:05,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:27:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:05,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:27:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:05,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:05,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:27:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:05,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:27:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:27:05,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:05,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330763879] [2024-11-11 20:27:05,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330763879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:05,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:27:05,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:27:05,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054751844] [2024-11-11 20:27:05,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:05,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:27:05,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:05,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:27:05,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:27:05,216 INFO L87 Difference]: Start difference. First operand 581 states and 915 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:27:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:07,837 INFO L93 Difference]: Finished difference Result 1244 states and 1985 transitions. [2024-11-11 20:27:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:27:07,837 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2024-11-11 20:27:07,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:07,841 INFO L225 Difference]: With dead ends: 1244 [2024-11-11 20:27:07,841 INFO L226 Difference]: Without dead ends: 739 [2024-11-11 20:27:07,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:27:07,842 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 666 mSDsluCounter, 2409 mSDsCounter, 0 mSdLazyCounter, 3265 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 2905 SdHoareTripleChecker+Invalid, 3375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 3265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:07,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 2905 Invalid, 3375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 3265 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 20:27:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-11 20:27:07,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 589. [2024-11-11 20:27:07,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 462 states have (on average 1.5692640692640694) internal successors, (725), 481 states have internal predecessors, (725), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-11-11 20:27:07,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 922 transitions. [2024-11-11 20:27:07,886 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 922 transitions. Word has length 73 [2024-11-11 20:27:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:07,886 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 922 transitions. [2024-11-11 20:27:07,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:27:07,887 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 922 transitions. [2024-11-11 20:27:07,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-11 20:27:07,887 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:07,888 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:07,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:27:07,888 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:07,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash 327814860, now seen corresponding path program 1 times [2024-11-11 20:27:07,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:07,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242059639] [2024-11-11 20:27:07,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:07,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:08,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:08,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:08,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:08,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:27:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:08,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:27:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:08,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:08,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:27:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:08,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:27:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:27:08,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:08,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242059639] [2024-11-11 20:27:08,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242059639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:08,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:27:08,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:27:08,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973649635] [2024-11-11 20:27:08,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:08,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:27:08,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:08,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:27:08,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:27:08,071 INFO L87 Difference]: Start difference. First operand 589 states and 922 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:27:10,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:10,094 INFO L93 Difference]: Finished difference Result 1299 states and 2049 transitions. [2024-11-11 20:27:10,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:27:10,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2024-11-11 20:27:10,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:10,098 INFO L225 Difference]: With dead ends: 1299 [2024-11-11 20:27:10,098 INFO L226 Difference]: Without dead ends: 707 [2024-11-11 20:27:10,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:27:10,100 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 626 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:10,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1599 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 20:27:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-11 20:27:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 570. [2024-11-11 20:27:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 446 states have (on average 1.5739910313901346) internal successors, (702), 463 states have internal predecessors, (702), 97 states have call successors, (97), 27 states have call predecessors, (97), 26 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-11 20:27:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 895 transitions. [2024-11-11 20:27:10,162 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 895 transitions. Word has length 73 [2024-11-11 20:27:10,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:10,162 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 895 transitions. [2024-11-11 20:27:10,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:27:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 895 transitions. [2024-11-11 20:27:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 20:27:10,163 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:10,163 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:10,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:27:10,163 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:10,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:10,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1182125521, now seen corresponding path program 1 times [2024-11-11 20:27:10,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:10,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298500610] [2024-11-11 20:27:10,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:10,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:10,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:10,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:10,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:10,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:27:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:10,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:27:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:10,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:10,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:27:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:10,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:27:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:27:10,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:10,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298500610] [2024-11-11 20:27:10,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298500610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:10,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:27:10,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:27:10,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150241633] [2024-11-11 20:27:10,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:10,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:27:10,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:10,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:27:10,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:27:10,406 INFO L87 Difference]: Start difference. First operand 570 states and 895 transitions. Second operand has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:27:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:12,849 INFO L93 Difference]: Finished difference Result 1228 states and 1953 transitions. [2024-11-11 20:27:12,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:27:12,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2024-11-11 20:27:12,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:12,856 INFO L225 Difference]: With dead ends: 1228 [2024-11-11 20:27:12,856 INFO L226 Difference]: Without dead ends: 722 [2024-11-11 20:27:12,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:27:12,857 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 650 mSDsluCounter, 2362 mSDsCounter, 0 mSdLazyCounter, 3234 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 2848 SdHoareTripleChecker+Invalid, 3344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 3234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:12,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 2848 Invalid, 3344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 3234 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 20:27:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2024-11-11 20:27:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 580. [2024-11-11 20:27:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 456 states have (on average 1.5614035087719298) internal successors, (712), 473 states have internal predecessors, (712), 97 states have call successors, (97), 27 states have call predecessors, (97), 26 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-11 20:27:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 905 transitions. [2024-11-11 20:27:12,897 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 905 transitions. Word has length 74 [2024-11-11 20:27:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:12,898 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 905 transitions. [2024-11-11 20:27:12,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:27:12,898 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 905 transitions. [2024-11-11 20:27:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-11 20:27:12,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:12,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:12,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:27:12,899 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:12,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:12,900 INFO L85 PathProgramCache]: Analyzing trace with hash -480673503, now seen corresponding path program 1 times [2024-11-11 20:27:12,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:12,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494186591] [2024-11-11 20:27:12,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:12,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 20:27:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:27:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:27:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:27:13,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:13,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494186591] [2024-11-11 20:27:13,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494186591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:13,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:27:13,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 20:27:13,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718008311] [2024-11-11 20:27:13,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:13,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 20:27:13,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:13,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 20:27:13,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:27:13,121 INFO L87 Difference]: Start difference. First operand 580 states and 905 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:27:15,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:15,736 INFO L93 Difference]: Finished difference Result 1824 states and 2932 transitions. [2024-11-11 20:27:15,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:27:15,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2024-11-11 20:27:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:15,743 INFO L225 Difference]: With dead ends: 1824 [2024-11-11 20:27:15,743 INFO L226 Difference]: Without dead ends: 1320 [2024-11-11 20:27:15,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:27:15,746 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 1880 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1978 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:15,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1978 Valid, 1078 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 20:27:15,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2024-11-11 20:27:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1017. [2024-11-11 20:27:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 801 states have (on average 1.5880149812734083) internal successors, (1272), 827 states have internal predecessors, (1272), 170 states have call successors, (170), 47 states have call predecessors, (170), 45 states have return successors, (175), 157 states have call predecessors, (175), 168 states have call successors, (175) [2024-11-11 20:27:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1617 transitions. [2024-11-11 20:27:15,858 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1617 transitions. Word has length 75 [2024-11-11 20:27:15,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:15,859 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1617 transitions. [2024-11-11 20:27:15,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:27:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1617 transitions. [2024-11-11 20:27:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-11 20:27:15,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:15,862 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:15,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:27:15,862 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:15,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:15,863 INFO L85 PathProgramCache]: Analyzing trace with hash 693390769, now seen corresponding path program 1 times [2024-11-11 20:27:15,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:15,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898515038] [2024-11-11 20:27:15,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:15,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:27:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:27:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:27:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:27:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:27:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:27:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:27:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-11 20:27:16,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:16,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898515038] [2024-11-11 20:27:16,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898515038] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:27:16,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71805233] [2024-11-11 20:27:16,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:16,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:16,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:27:16,446 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:27:16,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:27:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 1453 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:27:16,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:27:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 20:27:16,736 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:27:16,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71805233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:16,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:27:16,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2024-11-11 20:27:16,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362797098] [2024-11-11 20:27:16,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:16,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:27:16,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:16,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:27:16,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:27:16,738 INFO L87 Difference]: Start difference. First operand 1017 states and 1617 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:27:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:17,005 INFO L93 Difference]: Finished difference Result 2887 states and 4711 transitions. [2024-11-11 20:27:17,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:27:17,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2024-11-11 20:27:17,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:17,018 INFO L225 Difference]: With dead ends: 2887 [2024-11-11 20:27:17,018 INFO L226 Difference]: Without dead ends: 1947 [2024-11-11 20:27:17,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:27:17,023 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 851 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:17,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1647 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:27:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2024-11-11 20:27:17,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1935. [2024-11-11 20:27:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1520 states have (on average 1.6032894736842105) internal successors, (2437), 1569 states have internal predecessors, (2437), 327 states have call successors, (327), 89 states have call predecessors, (327), 87 states have return successors, (366), 306 states have call predecessors, (366), 323 states have call successors, (366) [2024-11-11 20:27:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 3130 transitions. [2024-11-11 20:27:17,210 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 3130 transitions. Word has length 128 [2024-11-11 20:27:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:17,210 INFO L471 AbstractCegarLoop]: Abstraction has 1935 states and 3130 transitions. [2024-11-11 20:27:17,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:27:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 3130 transitions. [2024-11-11 20:27:17,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-11 20:27:17,213 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:17,214 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:17,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:27:17,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 20:27:17,415 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:17,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:17,415 INFO L85 PathProgramCache]: Analyzing trace with hash 418631155, now seen corresponding path program 1 times [2024-11-11 20:27:17,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:17,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230701339] [2024-11-11 20:27:17,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:17,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:17,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:17,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:17,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:17,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:17,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:27:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:17,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:17,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:17,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:27:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:17,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:27:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:17,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:17,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:17,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:27:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:17,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:27:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:17,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:17,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:27:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:17,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:27:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-11 20:27:18,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:18,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230701339] [2024-11-11 20:27:18,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230701339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:27:18,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017762484] [2024-11-11 20:27:18,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:18,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:18,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:27:18,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:27:18,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:27:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:18,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 20:27:18,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:27:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:27:18,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:27:18,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017762484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:18,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:27:18,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 18 [2024-11-11 20:27:18,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312639499] [2024-11-11 20:27:18,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:18,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:27:18,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:18,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:27:18,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:27:18,406 INFO L87 Difference]: Start difference. First operand 1935 states and 3130 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:27:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:19,037 INFO L93 Difference]: Finished difference Result 3826 states and 6349 transitions. [2024-11-11 20:27:19,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:27:19,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2024-11-11 20:27:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:19,047 INFO L225 Difference]: With dead ends: 3826 [2024-11-11 20:27:19,047 INFO L226 Difference]: Without dead ends: 1967 [2024-11-11 20:27:19,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:27:19,056 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 802 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:19,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 2113 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 20:27:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2024-11-11 20:27:19,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1967. [2024-11-11 20:27:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1548 states have (on average 1.605297157622739) internal successors, (2485), 1597 states have internal predecessors, (2485), 327 states have call successors, (327), 93 states have call predecessors, (327), 91 states have return successors, (370), 306 states have call predecessors, (370), 323 states have call successors, (370) [2024-11-11 20:27:19,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3182 transitions. [2024-11-11 20:27:19,259 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3182 transitions. Word has length 128 [2024-11-11 20:27:19,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:19,260 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 3182 transitions. [2024-11-11 20:27:19,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:27:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3182 transitions. [2024-11-11 20:27:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 20:27:19,263 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:19,263 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:19,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 20:27:19,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:19,464 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:19,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash -797832811, now seen corresponding path program 1 times [2024-11-11 20:27:19,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:19,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805450230] [2024-11-11 20:27:19,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:19,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:19,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:19,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:19,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:19,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:19,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:27:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:19,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:19,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:19,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:27:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:19,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:27:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:19,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:19,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:19,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:27:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:19,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:27:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:19,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:19,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:27:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:27:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,001 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-11 20:27:20,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:20,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805450230] [2024-11-11 20:27:20,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805450230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:27:20,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444053626] [2024-11-11 20:27:20,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:20,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:20,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:27:20,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:27:20,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:27:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 1457 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 20:27:20,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:27:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 20:27:20,336 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:27:20,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444053626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:20,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:27:20,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 18 [2024-11-11 20:27:20,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110914941] [2024-11-11 20:27:20,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:20,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:27:20,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:20,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:27:20,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:27:20,337 INFO L87 Difference]: Start difference. First operand 1967 states and 3182 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:27:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:20,953 INFO L93 Difference]: Finished difference Result 3890 states and 6441 transitions. [2024-11-11 20:27:20,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:27:20,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-11 20:27:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:20,964 INFO L225 Difference]: With dead ends: 3890 [2024-11-11 20:27:20,964 INFO L226 Difference]: Without dead ends: 1999 [2024-11-11 20:27:20,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:27:20,974 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 790 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:20,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2110 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:27:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2024-11-11 20:27:21,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1999. [2024-11-11 20:27:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1999 states, 1576 states have (on average 1.607233502538071) internal successors, (2533), 1625 states have internal predecessors, (2533), 327 states have call successors, (327), 97 states have call predecessors, (327), 95 states have return successors, (374), 306 states have call predecessors, (374), 323 states have call successors, (374) [2024-11-11 20:27:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 3234 transitions. [2024-11-11 20:27:21,193 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 3234 transitions. Word has length 131 [2024-11-11 20:27:21,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:21,193 INFO L471 AbstractCegarLoop]: Abstraction has 1999 states and 3234 transitions. [2024-11-11 20:27:21,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:27:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 3234 transitions. [2024-11-11 20:27:21,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-11 20:27:21,197 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:21,197 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:21,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:27:21,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:21,398 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:21,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1288536751, now seen corresponding path program 1 times [2024-11-11 20:27:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:21,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935121069] [2024-11-11 20:27:21,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:21,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:27:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:27:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:27:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:27:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:27:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-11 20:27:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 20:27:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-11 20:27:21,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:21,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935121069] [2024-11-11 20:27:21,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935121069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:27:21,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266072823] [2024-11-11 20:27:21,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:21,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:21,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:27:21,964 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:27:21,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:27:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:22,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 1460 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 20:27:22,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:27:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 20:27:22,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:27:22,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266072823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:22,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:27:22,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 18 [2024-11-11 20:27:22,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683632344] [2024-11-11 20:27:22,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:22,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:27:22,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:22,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:27:22,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:27:22,331 INFO L87 Difference]: Start difference. First operand 1999 states and 3234 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:27:22,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:22,878 INFO L93 Difference]: Finished difference Result 3954 states and 6533 transitions. [2024-11-11 20:27:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:27:22,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2024-11-11 20:27:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:22,890 INFO L225 Difference]: With dead ends: 3954 [2024-11-11 20:27:22,890 INFO L226 Difference]: Without dead ends: 2031 [2024-11-11 20:27:22,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:27:22,899 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 792 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 2107 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:22,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 2107 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:27:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2024-11-11 20:27:23,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2031. [2024-11-11 20:27:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2031 states, 1604 states have (on average 1.6091022443890275) internal successors, (2581), 1653 states have internal predecessors, (2581), 327 states have call successors, (327), 101 states have call predecessors, (327), 99 states have return successors, (378), 306 states have call predecessors, (378), 323 states have call successors, (378) [2024-11-11 20:27:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 3286 transitions. [2024-11-11 20:27:23,090 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 3286 transitions. Word has length 134 [2024-11-11 20:27:23,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:23,090 INFO L471 AbstractCegarLoop]: Abstraction has 2031 states and 3286 transitions. [2024-11-11 20:27:23,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:27:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 3286 transitions. [2024-11-11 20:27:23,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-11 20:27:23,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:23,093 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:23,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 20:27:23,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:23,294 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:23,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:23,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1763735672, now seen corresponding path program 1 times [2024-11-11 20:27:23,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:23,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763507569] [2024-11-11 20:27:23,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:23,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:27:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 20:27:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:27:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 20:27:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:27:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:27:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-11 20:27:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 20:27:23,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:23,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763507569] [2024-11-11 20:27:23,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763507569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:27:23,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797782190] [2024-11-11 20:27:23,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:23,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:23,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:27:23,771 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:27:23,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 20:27:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:24,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:27:24,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:27:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-11 20:27:24,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:27:24,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797782190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:24,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:27:24,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2024-11-11 20:27:24,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427268006] [2024-11-11 20:27:24,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:24,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:27:24,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:24,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:27:24,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:27:24,092 INFO L87 Difference]: Start difference. First operand 2031 states and 3286 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:27:24,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:24,708 INFO L93 Difference]: Finished difference Result 5174 states and 8408 transitions. [2024-11-11 20:27:24,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:27:24,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2024-11-11 20:27:24,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:24,726 INFO L225 Difference]: With dead ends: 5174 [2024-11-11 20:27:24,726 INFO L226 Difference]: Without dead ends: 3219 [2024-11-11 20:27:24,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:27:24,732 INFO L435 NwaCegarLoop]: 1134 mSDtfsCounter, 805 mSDsluCounter, 3321 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 4455 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:24,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 4455 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:27:24,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3219 states. [2024-11-11 20:27:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3219 to 3217. [2024-11-11 20:27:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3217 states, 2544 states have (on average 1.5782232704402517) internal successors, (4015), 2597 states have internal predecessors, (4015), 501 states have call successors, (501), 175 states have call predecessors, (501), 171 states have return successors, (656), 476 states have call predecessors, (656), 493 states have call successors, (656) [2024-11-11 20:27:25,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 5172 transitions. [2024-11-11 20:27:25,056 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 5172 transitions. Word has length 136 [2024-11-11 20:27:25,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:25,057 INFO L471 AbstractCegarLoop]: Abstraction has 3217 states and 5172 transitions. [2024-11-11 20:27:25,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:27:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 5172 transitions. [2024-11-11 20:27:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-11 20:27:25,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:25,061 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:25,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 20:27:25,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-11 20:27:25,262 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:25,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:25,263 INFO L85 PathProgramCache]: Analyzing trace with hash 330032007, now seen corresponding path program 1 times [2024-11-11 20:27:25,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:25,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542910402] [2024-11-11 20:27:25,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:25,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:27:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 20:27:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:27:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 20:27:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:27:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:27:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 20:27:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 20:27:25,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:25,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542910402] [2024-11-11 20:27:25,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542910402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:27:25,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524671696] [2024-11-11 20:27:25,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:25,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:25,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:27:25,736 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:27:25,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 20:27:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:25,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 1460 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 20:27:25,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:27:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:27:26,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:27:26,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524671696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:26,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:27:26,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 18 [2024-11-11 20:27:26,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493114982] [2024-11-11 20:27:26,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:26,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:27:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:26,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:27:26,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:27:26,045 INFO L87 Difference]: Start difference. First operand 3217 states and 5172 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:27:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:26,661 INFO L93 Difference]: Finished difference Result 6422 states and 10591 transitions. [2024-11-11 20:27:26,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:27:26,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2024-11-11 20:27:26,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:26,677 INFO L225 Difference]: With dead ends: 6422 [2024-11-11 20:27:26,678 INFO L226 Difference]: Without dead ends: 3281 [2024-11-11 20:27:26,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:27:26,689 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 772 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 2104 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:26,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 2104 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:27:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2024-11-11 20:27:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 3281. [2024-11-11 20:27:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3281 states, 2600 states have (on average 1.5811538461538461) internal successors, (4111), 2653 states have internal predecessors, (4111), 501 states have call successors, (501), 183 states have call predecessors, (501), 179 states have return successors, (664), 476 states have call predecessors, (664), 493 states have call successors, (664) [2024-11-11 20:27:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 5276 transitions. [2024-11-11 20:27:27,001 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 5276 transitions. Word has length 137 [2024-11-11 20:27:27,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:27,002 INFO L471 AbstractCegarLoop]: Abstraction has 3281 states and 5276 transitions. [2024-11-11 20:27:27,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:27:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 5276 transitions. [2024-11-11 20:27:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-11 20:27:27,005 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:27,005 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:27,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 20:27:27,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:27,206 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:27,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:27,207 INFO L85 PathProgramCache]: Analyzing trace with hash -560477783, now seen corresponding path program 1 times [2024-11-11 20:27:27,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:27,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670500430] [2024-11-11 20:27:27,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:27,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:27:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:27:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 20:27:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:27:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:27:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 20:27:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 20:27:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-11 20:27:27,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:27,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670500430] [2024-11-11 20:27:27,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670500430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:27:27,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046678114] [2024-11-11 20:27:27,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:27,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:27,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:27:27,873 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:27:27,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 20:27:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:28,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 20:27:28,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:27:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:27:28,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:27:28,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046678114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:28,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:27:28,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 20 [2024-11-11 20:27:28,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068066347] [2024-11-11 20:27:28,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:28,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:27:28,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:28,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:27:28,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-11-11 20:27:28,221 INFO L87 Difference]: Start difference. First operand 3281 states and 5276 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 6 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-11 20:27:29,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:29,838 INFO L93 Difference]: Finished difference Result 6750 states and 10881 transitions. [2024-11-11 20:27:29,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:27:29,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 6 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 140 [2024-11-11 20:27:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:29,860 INFO L225 Difference]: With dead ends: 6750 [2024-11-11 20:27:29,860 INFO L226 Difference]: Without dead ends: 3550 [2024-11-11 20:27:29,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2024-11-11 20:27:29,871 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 1452 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:29,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 1115 Invalid, 2602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:27:29,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3550 states. [2024-11-11 20:27:30,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3550 to 3280. [2024-11-11 20:27:30,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3280 states, 2494 states have (on average 1.5417000801924619) internal successors, (3845), 2585 states have internal predecessors, (3845), 606 states have call successors, (606), 169 states have call predecessors, (606), 179 states have return successors, (746), 577 states have call predecessors, (746), 598 states have call successors, (746) [2024-11-11 20:27:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 3280 states and 5197 transitions. [2024-11-11 20:27:30,230 INFO L78 Accepts]: Start accepts. Automaton has 3280 states and 5197 transitions. Word has length 140 [2024-11-11 20:27:30,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:30,231 INFO L471 AbstractCegarLoop]: Abstraction has 3280 states and 5197 transitions. [2024-11-11 20:27:30,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 6 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-11 20:27:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3280 states and 5197 transitions. [2024-11-11 20:27:30,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-11 20:27:30,234 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:30,234 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:30,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 20:27:30,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:30,436 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:30,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:30,436 INFO L85 PathProgramCache]: Analyzing trace with hash 171489643, now seen corresponding path program 1 times [2024-11-11 20:27:30,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:30,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063364183] [2024-11-11 20:27:30,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:30,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:27:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:31,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:31,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:31,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:27:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:31,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 20:27:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:31,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:31,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:31,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:27:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:31,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:27:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:31,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:31,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 20:27:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:31,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 20:27:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-11 20:27:31,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:31,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063364183] [2024-11-11 20:27:31,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063364183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:27:31,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589419115] [2024-11-11 20:27:31,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:31,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:31,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:27:31,124 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:27:31,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 20:27:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:31,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-11 20:27:31,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:27:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 20:27:31,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:27:31,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589419115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:31,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:27:31,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 22 [2024-11-11 20:27:31,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110370044] [2024-11-11 20:27:31,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:31,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:27:31,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:31,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:27:31,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2024-11-11 20:27:31,505 INFO L87 Difference]: Start difference. First operand 3280 states and 5197 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 6 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-11 20:27:34,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:34,084 INFO L93 Difference]: Finished difference Result 7591 states and 12130 transitions. [2024-11-11 20:27:34,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 20:27:34,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 6 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 140 [2024-11-11 20:27:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:34,103 INFO L225 Difference]: With dead ends: 7591 [2024-11-11 20:27:34,103 INFO L226 Difference]: Without dead ends: 4389 [2024-11-11 20:27:34,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2024-11-11 20:27:34,114 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 2307 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 4957 mSolverCounterSat, 524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 2336 SdHoareTripleChecker+Invalid, 5481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 524 IncrementalHoareTripleChecker+Valid, 4957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:34,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2401 Valid, 2336 Invalid, 5481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [524 Valid, 4957 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 20:27:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4389 states. [2024-11-11 20:27:34,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4389 to 3806. [2024-11-11 20:27:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3806 states, 2886 states have (on average 1.5443520443520444) internal successors, (4457), 2999 states have internal predecessors, (4457), 696 states have call successors, (696), 191 states have call predecessors, (696), 223 states have return successors, (891), 667 states have call predecessors, (891), 688 states have call successors, (891) [2024-11-11 20:27:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 6044 transitions. [2024-11-11 20:27:34,656 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 6044 transitions. Word has length 140 [2024-11-11 20:27:34,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:34,657 INFO L471 AbstractCegarLoop]: Abstraction has 3806 states and 6044 transitions. [2024-11-11 20:27:34,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 6 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-11 20:27:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 6044 transitions. [2024-11-11 20:27:34,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-11 20:27:34,660 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:34,660 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:34,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-11 20:27:34,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-11 20:27:34,861 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:34,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:34,861 INFO L85 PathProgramCache]: Analyzing trace with hash -16455701, now seen corresponding path program 1 times [2024-11-11 20:27:34,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:34,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826948591] [2024-11-11 20:27:34,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:34,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:27:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:27:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 20:27:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:27:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:27:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:27:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-11 20:27:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-11 20:27:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-11 20:27:35,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:35,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826948591] [2024-11-11 20:27:35,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826948591] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:27:35,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587191312] [2024-11-11 20:27:35,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:35,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:35,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:27:35,542 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:27:35,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 20:27:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 20:27:35,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:27:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 20:27:35,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:27:35,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587191312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:35,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:27:35,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2024-11-11 20:27:35,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70958725] [2024-11-11 20:27:35,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:35,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:27:35,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:35,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:27:35,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:27:35,946 INFO L87 Difference]: Start difference. First operand 3806 states and 6044 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-11 20:27:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:39,628 INFO L93 Difference]: Finished difference Result 10284 states and 16699 transitions. [2024-11-11 20:27:39,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 20:27:39,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) Word has length 142 [2024-11-11 20:27:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:39,658 INFO L225 Difference]: With dead ends: 10284 [2024-11-11 20:27:39,658 INFO L226 Difference]: Without dead ends: 6556 [2024-11-11 20:27:39,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2024-11-11 20:27:39,673 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 2666 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 5806 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2766 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 6470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 5806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:39,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2766 Valid, 2215 Invalid, 6470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 5806 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 20:27:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6556 states. [2024-11-11 20:27:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6556 to 5934. [2024-11-11 20:27:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5934 states, 4485 states have (on average 1.5500557413600893) internal successors, (6952), 4671 states have internal predecessors, (6952), 1084 states have call successors, (1084), 291 states have call predecessors, (1084), 364 states have return successors, (1508), 1048 states have call predecessors, (1508), 1076 states have call successors, (1508) [2024-11-11 20:27:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5934 states to 5934 states and 9544 transitions. [2024-11-11 20:27:40,343 INFO L78 Accepts]: Start accepts. Automaton has 5934 states and 9544 transitions. Word has length 142 [2024-11-11 20:27:40,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:40,343 INFO L471 AbstractCegarLoop]: Abstraction has 5934 states and 9544 transitions. [2024-11-11 20:27:40,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-11 20:27:40,344 INFO L276 IsEmpty]: Start isEmpty. Operand 5934 states and 9544 transitions. [2024-11-11 20:27:40,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 20:27:40,346 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:40,346 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:40,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-11 20:27:40,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-11 20:27:40,547 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:40,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:40,548 INFO L85 PathProgramCache]: Analyzing trace with hash -836245353, now seen corresponding path program 1 times [2024-11-11 20:27:40,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:40,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158184008] [2024-11-11 20:27:40,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:40,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:40,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:40,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:40,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:40,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:27:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:27:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 20:27:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:27:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:27:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:27:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:27:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 20:27:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-11 20:27:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-11 20:27:41,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:41,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158184008] [2024-11-11 20:27:41,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158184008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:41,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:27:41,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:27:41,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541237782] [2024-11-11 20:27:41,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:41,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:27:41,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:41,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:27:41,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:27:41,109 INFO L87 Difference]: Start difference. First operand 5934 states and 9544 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16)