./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec14_product19.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_product19.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 5643166a994eeb2bd259cf18f0a4b43a93b8e6b433c116ad537f0a1a02a75ec3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:26:28,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:26:28,199 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:28,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:26:28,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:26:28,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:26:28,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:26:28,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:26:28,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:26:28,240 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:26:28,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:26:28,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:26:28,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:26:28,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:26:28,242 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:26:28,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:26:28,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:26:28,243 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:26:28,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:26:28,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:26:28,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:26:28,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:26:28,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:26:28,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:26:28,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:26:28,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:26:28,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:26:28,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:26:28,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:26:28,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:26:28,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:26:28,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:26:28,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:26:28,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:26:28,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:26:28,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:26:28,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:26:28,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:26:28,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:26:28,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:26:28,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:26:28,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:26:28,256 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 -> 5643166a994eeb2bd259cf18f0a4b43a93b8e6b433c116ad537f0a1a02a75ec3 [2024-11-11 20:26:28,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:26:28,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:26:28,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:26:28,573 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:26:28,574 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:26:28,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec14_product19.cil.c [2024-11-11 20:26:30,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:26:30,459 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:26:30,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product19.cil.c [2024-11-11 20:26:30,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea00ef5d5/b1a3a63943db49a6955bd1cf0f2a589c/FLAG0b1cbbdc2 [2024-11-11 20:26:30,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea00ef5d5/b1a3a63943db49a6955bd1cf0f2a589c [2024-11-11 20:26:30,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:26:30,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:26:30,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:26:30,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:26:30,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:26:30,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:26:30" (1/1) ... [2024-11-11 20:26:30,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f8efac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:30, skipping insertion in model container [2024-11-11 20:26:30,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:26:30" (1/1) ... [2024-11-11 20:26:30,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:26:31,070 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_product19.cil.c[49225,49238] [2024-11-11 20:26:31,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:26:31,149 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:26:31,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [48] [2024-11-11 20:26:31,161 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1591] [2024-11-11 20:26:31,161 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [1685] [2024-11-11 20:26:31,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1722] [2024-11-11 20:26:31,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1740] [2024-11-11 20:26:31,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2106] [2024-11-11 20:26:31,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2144] [2024-11-11 20:26:31,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2262] [2024-11-11 20:26:31,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2271] [2024-11-11 20:26:31,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2619] [2024-11-11 20:26:31,227 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_product19.cil.c[49225,49238] [2024-11-11 20:26:31,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:26:31,274 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:26:31,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:31 WrapperNode [2024-11-11 20:26:31,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:26:31,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:26:31,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:26:31,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:26:31,282 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:31" (1/1) ... [2024-11-11 20:26:31,313 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:31" (1/1) ... [2024-11-11 20:26:31,357 INFO L138 Inliner]: procedures = 91, calls = 333, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 1050 [2024-11-11 20:26:31,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:26:31,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:26:31,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:26:31,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:26:31,370 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:31" (1/1) ... [2024-11-11 20:26:31,370 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:31" (1/1) ... [2024-11-11 20:26:31,376 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:31" (1/1) ... [2024-11-11 20:26:31,413 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-11-11 20:26:31,413 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:31" (1/1) ... [2024-11-11 20:26:31,413 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:31" (1/1) ... [2024-11-11 20:26:31,438 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:31" (1/1) ... [2024-11-11 20:26:31,454 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:31" (1/1) ... [2024-11-11 20:26:31,459 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:31" (1/1) ... [2024-11-11 20:26:31,465 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:31" (1/1) ... [2024-11-11 20:26:31,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:26:31,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:26:31,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:26:31,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:26:31,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:31" (1/1) ... [2024-11-11 20:26:31,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:26:31,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:26:31,531 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:31,535 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:31,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:26:31,585 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-11 20:26:31,585 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-11 20:26:31,585 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-11 20:26:31,586 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-11 20:26:31,586 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2024-11-11 20:26:31,586 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2024-11-11 20:26:31,586 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-11 20:26:31,587 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-11 20:26:31,588 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-11-11 20:26:31,588 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-11-11 20:26:31,588 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-11 20:26:31,588 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-11 20:26:31,588 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-11-11 20:26:31,588 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-11-11 20:26:31,588 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-11 20:26:31,588 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-11 20:26:31,588 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:26:31,589 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:26:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:26:31,589 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:26:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-11 20:26:31,589 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-11 20:26:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-11 20:26:31,589 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-11 20:26:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-11 20:26:31,589 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-11 20:26:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-11-11 20:26:31,589 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-11-11 20:26:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-11 20:26:31,589 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-11 20:26:31,590 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-11 20:26:31,590 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-11 20:26:31,590 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-11 20:26:31,590 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-11 20:26:31,590 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-11 20:26:31,590 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-11 20:26:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-11 20:26:31,591 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-11 20:26:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:26:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:26:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:26:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:26:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-11 20:26:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-11 20:26:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-11 20:26:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-11 20:26:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-11 20:26:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-11 20:26:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-11 20:26:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-11 20:26:31,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-11 20:26:31,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-11 20:26:31,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-11 20:26:31,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-11 20:26:31,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-11 20:26:31,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-11 20:26:31,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-11 20:26:31,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-11 20:26:31,595 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-11 20:26:31,595 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-11 20:26:31,595 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-11 20:26:31,597 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-11 20:26:31,597 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-11 20:26:31,597 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-11 20:26:31,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:26:31,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:26:31,597 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-11 20:26:31,597 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-11 20:26:31,804 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:26:31,807 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:26:33,009 INFO L? ?]: Removed 440 outVars from TransFormulas that were not future-live. [2024-11-11 20:26:33,009 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:26:33,043 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:26:33,044 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:26:33,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:26:33 BoogieIcfgContainer [2024-11-11 20:26:33,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:26:33,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:26:33,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:26:33,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:26:33,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:26:30" (1/3) ... [2024-11-11 20:26:33,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b46f4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:26:33, skipping insertion in model container [2024-11-11 20:26:33,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:26:31" (2/3) ... [2024-11-11 20:26:33,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b46f4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:26:33, skipping insertion in model container [2024-11-11 20:26:33,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:26:33" (3/3) ... [2024-11-11 20:26:33,061 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product19.cil.c [2024-11-11 20:26:33,079 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:26:33,079 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:26:33,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:26:33,169 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;@7581ea52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:26:33,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:26:33,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 532 states, 414 states have (on average 1.6763285024154588) internal successors, (694), 430 states have internal predecessors, (694), 93 states have call successors, (93), 23 states have call predecessors, (93), 23 states have return successors, (93), 91 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-11 20:26:33,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 20:26:33,201 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:33,202 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:33,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:33,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:33,209 INFO L85 PathProgramCache]: Analyzing trace with hash 124463842, now seen corresponding path program 1 times [2024-11-11 20:26:33,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:33,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983339845] [2024-11-11 20:26:33,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:33,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:33,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:34,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:34,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:34,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:26:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:34,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:34,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:26:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:34,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 20:26:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:34,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:34,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:34,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:26:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:34,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:26:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:34,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:34,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:26:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:26:34,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:34,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983339845] [2024-11-11 20:26:34,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983339845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:34,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:34,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:26:34,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748123767] [2024-11-11 20:26:34,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:34,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:26:34,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:34,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:26:34,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:26:34,209 INFO L87 Difference]: Start difference. First operand has 532 states, 414 states have (on average 1.6763285024154588) internal successors, (694), 430 states have internal predecessors, (694), 93 states have call successors, (93), 23 states have call predecessors, (93), 23 states have return successors, (93), 91 states have call predecessors, (93), 93 states have call successors, (93) Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:26:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:38,646 INFO L93 Difference]: Finished difference Result 1261 states and 2116 transitions. [2024-11-11 20:26:38,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:26:38,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-11-11 20:26:38,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:38,673 INFO L225 Difference]: With dead ends: 1261 [2024-11-11 20:26:38,673 INFO L226 Difference]: Without dead ends: 725 [2024-11-11 20:26:38,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:26:38,693 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 1319 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 2751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:38,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1366 Valid, 1243 Invalid, 2751 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [378 Valid, 2373 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-11 20:26:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-11 20:26:38,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 527. [2024-11-11 20:26:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 410 states have (on average 1.6658536585365853) internal successors, (683), 425 states have internal predecessors, (683), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-11 20:26:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 868 transitions. [2024-11-11 20:26:38,903 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 868 transitions. Word has length 101 [2024-11-11 20:26:38,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:38,904 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 868 transitions. [2024-11-11 20:26:38,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:26:38,905 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 868 transitions. [2024-11-11 20:26:38,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-11 20:26:38,911 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:38,911 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:38,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:26:38,912 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:38,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:38,912 INFO L85 PathProgramCache]: Analyzing trace with hash -641430685, now seen corresponding path program 1 times [2024-11-11 20:26:38,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:38,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245890088] [2024-11-11 20:26:38,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:38,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:39,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:39,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:39,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:26:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:39,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:26:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:39,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:39,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 20:26:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:39,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:26:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:39,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:39,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:39,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:26:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:39,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:26:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:39,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:39,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:26:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:26:39,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:39,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245890088] [2024-11-11 20:26:39,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245890088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:39,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:39,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:26:39,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361472249] [2024-11-11 20:26:39,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:39,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:26:39,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:39,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:26:39,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:26:39,385 INFO L87 Difference]: Start difference. First operand 527 states and 868 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:26:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:43,175 INFO L93 Difference]: Finished difference Result 1235 states and 2043 transitions. [2024-11-11 20:26:43,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:26:43,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2024-11-11 20:26:43,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:43,182 INFO L225 Difference]: With dead ends: 1235 [2024-11-11 20:26:43,183 INFO L226 Difference]: Without dead ends: 725 [2024-11-11 20:26:43,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:26:43,188 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1300 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:43,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 1183 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 20:26:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-11 20:26:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 527. [2024-11-11 20:26:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 410 states have (on average 1.6634146341463414) internal successors, (682), 425 states have internal predecessors, (682), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-11 20:26:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 867 transitions. [2024-11-11 20:26:43,311 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 867 transitions. Word has length 102 [2024-11-11 20:26:43,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:43,311 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 867 transitions. [2024-11-11 20:26:43,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:26:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 867 transitions. [2024-11-11 20:26:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 20:26:43,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:43,335 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:43,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:26:43,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:43,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:43,336 INFO L85 PathProgramCache]: Analyzing trace with hash 844801918, now seen corresponding path program 1 times [2024-11-11 20:26:43,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:43,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235501974] [2024-11-11 20:26:43,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:43,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 20:26:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:26:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:26:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 20:26:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:26:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:26:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:26:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:26:43,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:43,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235501974] [2024-11-11 20:26:43,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235501974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:43,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:43,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:26:43,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635622059] [2024-11-11 20:26:43,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:43,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:26:43,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:43,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:26:43,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:26:43,767 INFO L87 Difference]: Start difference. First operand 527 states and 867 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:26:46,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:46,810 INFO L93 Difference]: Finished difference Result 1235 states and 2042 transitions. [2024-11-11 20:26:46,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:26:46,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-11-11 20:26:46,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:46,816 INFO L225 Difference]: With dead ends: 1235 [2024-11-11 20:26:46,816 INFO L226 Difference]: Without dead ends: 725 [2024-11-11 20:26:46,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:26:46,820 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 1289 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:46,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 1216 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 20:26:46,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-11 20:26:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 527. [2024-11-11 20:26:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 410 states have (on average 1.6609756097560975) internal successors, (681), 425 states have internal predecessors, (681), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-11 20:26:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 866 transitions. [2024-11-11 20:26:46,906 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 866 transitions. Word has length 103 [2024-11-11 20:26:46,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:46,906 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 866 transitions. [2024-11-11 20:26:46,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:26:46,906 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 866 transitions. [2024-11-11 20:26:46,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 20:26:46,909 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:46,910 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:46,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:26:46,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:46,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:46,911 INFO L85 PathProgramCache]: Analyzing trace with hash -867468481, now seen corresponding path program 1 times [2024-11-11 20:26:46,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:46,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872778307] [2024-11-11 20:26:46,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:46,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:47,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:47,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:47,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:26:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:47,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:26:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:47,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:47,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 20:26:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:47,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:26:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:47,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:47,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:47,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:26:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:47,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:26:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:47,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:47,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:26:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:26:47,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:47,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872778307] [2024-11-11 20:26:47,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872778307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:47,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:47,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:26:47,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417268802] [2024-11-11 20:26:47,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:47,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:26:47,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:47,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:26:47,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:26:47,285 INFO L87 Difference]: Start difference. First operand 527 states and 866 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:26:50,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:50,550 INFO L93 Difference]: Finished difference Result 1235 states and 2041 transitions. [2024-11-11 20:26:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:26:50,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-11-11 20:26:50,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:50,555 INFO L225 Difference]: With dead ends: 1235 [2024-11-11 20:26:50,556 INFO L226 Difference]: Without dead ends: 725 [2024-11-11 20:26:50,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:26:50,560 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 1290 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:50,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 1198 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 20:26:50,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-11 20:26:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 527. [2024-11-11 20:26:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 410 states have (on average 1.6585365853658536) internal successors, (680), 425 states have internal predecessors, (680), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-11 20:26:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 865 transitions. [2024-11-11 20:26:50,652 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 865 transitions. Word has length 104 [2024-11-11 20:26:50,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:50,653 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 865 transitions. [2024-11-11 20:26:50,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:26:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 865 transitions. [2024-11-11 20:26:50,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-11 20:26:50,656 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:50,657 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:50,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:26:50,657 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:50,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:50,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1345883162, now seen corresponding path program 1 times [2024-11-11 20:26:50,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:50,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312846942] [2024-11-11 20:26:50,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:50,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:50,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:50,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:50,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:26:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:50,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:26:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:50,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:50,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:26:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:50,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:26:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:50,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:50,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:50,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:26:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:50,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:26:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:50,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:50,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:26:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:26:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312846942] [2024-11-11 20:26:50,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312846942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:50,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:50,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:26:50,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324270373] [2024-11-11 20:26:50,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:50,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:26:50,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:50,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:26:50,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:26:50,983 INFO L87 Difference]: Start difference. First operand 527 states and 865 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:26:54,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:54,003 INFO L93 Difference]: Finished difference Result 1235 states and 2040 transitions. [2024-11-11 20:26:54,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:26:54,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-11-11 20:26:54,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:54,008 INFO L225 Difference]: With dead ends: 1235 [2024-11-11 20:26:54,008 INFO L226 Difference]: Without dead ends: 725 [2024-11-11 20:26:54,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:26:54,014 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 1281 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 2743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:54,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 1219 Invalid, 2743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 20:26:54,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-11 20:26:54,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 527. [2024-11-11 20:26:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 410 states have (on average 1.6560975609756097) internal successors, (679), 425 states have internal predecessors, (679), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-11 20:26:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 864 transitions. [2024-11-11 20:26:54,111 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 864 transitions. Word has length 105 [2024-11-11 20:26:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:54,111 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 864 transitions. [2024-11-11 20:26:54,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:26:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 864 transitions. [2024-11-11 20:26:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-11 20:26:54,114 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:54,114 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:54,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:26:54,114 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:54,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:54,115 INFO L85 PathProgramCache]: Analyzing trace with hash 699466523, now seen corresponding path program 1 times [2024-11-11 20:26:54,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:54,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964811729] [2024-11-11 20:26:54,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:54,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:54,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:54,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:54,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:26:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:54,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:26:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:54,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:54,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 20:26:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:54,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:26:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:54,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:54,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:54,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:26:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:54,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:26:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:54,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:54,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:26:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:26:54,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:54,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964811729] [2024-11-11 20:26:54,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964811729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:54,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:54,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:26:54,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738603436] [2024-11-11 20:26:54,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:54,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:26:54,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:54,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:26:54,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:26:54,507 INFO L87 Difference]: Start difference. First operand 527 states and 864 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:26:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:26:57,785 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions. [2024-11-11 20:26:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:26:57,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-11-11 20:26:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:26:57,790 INFO L225 Difference]: With dead ends: 1275 [2024-11-11 20:26:57,790 INFO L226 Difference]: Without dead ends: 769 [2024-11-11 20:26:57,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:26:57,794 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1359 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1406 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 2774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:26:57,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1406 Valid, 1250 Invalid, 2774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 20:26:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-11 20:26:57,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 547. [2024-11-11 20:26:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 429 states have (on average 1.6503496503496504) internal successors, (708), 444 states have internal predecessors, (708), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-11 20:26:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 893 transitions. [2024-11-11 20:26:57,899 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 893 transitions. Word has length 106 [2024-11-11 20:26:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:26:57,899 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 893 transitions. [2024-11-11 20:26:57,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:26:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 893 transitions. [2024-11-11 20:26:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-11 20:26:57,903 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:26:57,904 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:26:57,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:26:57,904 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:26:57,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:26:57,905 INFO L85 PathProgramCache]: Analyzing trace with hash -915924437, now seen corresponding path program 1 times [2024-11-11 20:26:57,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:26:57,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974334538] [2024-11-11 20:26:57,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:26:57,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:26:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:58,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:26:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:58,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:58,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:26:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:58,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:26:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:58,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:58,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:26:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:58,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:26:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:58,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:58,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:58,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:26:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:58,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:26:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:58,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:26:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:58,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:26:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:26:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:26:58,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:26:58,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974334538] [2024-11-11 20:26:58,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974334538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:26:58,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:26:58,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:26:58,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996283046] [2024-11-11 20:26:58,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:26:58,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:26:58,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:26:58,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:26:58,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:26:58,247 INFO L87 Difference]: Start difference. First operand 547 states and 893 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:27:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:01,168 INFO L93 Difference]: Finished difference Result 1259 states and 2055 transitions. [2024-11-11 20:27:01,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:27:01,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2024-11-11 20:27:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:01,172 INFO L225 Difference]: With dead ends: 1259 [2024-11-11 20:27:01,172 INFO L226 Difference]: Without dead ends: 769 [2024-11-11 20:27:01,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:27:01,175 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 1349 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:01,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 1189 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 2373 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 20:27:01,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-11 20:27:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 547. [2024-11-11 20:27:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 429 states have (on average 1.6386946386946386) internal successors, (703), 444 states have internal predecessors, (703), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-11 20:27:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 888 transitions. [2024-11-11 20:27:01,270 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 888 transitions. Word has length 107 [2024-11-11 20:27:01,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:01,271 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 888 transitions. [2024-11-11 20:27:01,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:27:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 888 transitions. [2024-11-11 20:27:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-11 20:27:01,274 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:01,274 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:01,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:27:01,275 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:01,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:01,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1711220192, now seen corresponding path program 1 times [2024-11-11 20:27:01,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:01,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080075397] [2024-11-11 20:27:01,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:01,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:01,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:01,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:01,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:01,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:27:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:01,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:01,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:27:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:01,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:27:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:01,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:01,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:01,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:27:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:01,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:27:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:01,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:01,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:27:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:27:01,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:01,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080075397] [2024-11-11 20:27:01,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080075397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:01,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:27:01,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:27:01,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781198874] [2024-11-11 20:27:01,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:01,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:27:01,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:01,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:27:01,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:27:01,662 INFO L87 Difference]: Start difference. First operand 547 states and 888 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:27:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:06,023 INFO L93 Difference]: Finished difference Result 1270 states and 2070 transitions. [2024-11-11 20:27:06,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 20:27:06,024 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 108 [2024-11-11 20:27:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:06,028 INFO L225 Difference]: With dead ends: 1270 [2024-11-11 20:27:06,028 INFO L226 Difference]: Without dead ends: 789 [2024-11-11 20:27:06,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-11-11 20:27:06,031 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 1378 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 4533 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 2221 SdHoareTripleChecker+Invalid, 4916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 4533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:06,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1425 Valid, 2221 Invalid, 4916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 4533 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-11 20:27:06,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-11-11 20:27:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 560. [2024-11-11 20:27:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 439 states have (on average 1.6355353075170842) internal successors, (718), 456 states have internal predecessors, (718), 94 states have call successors, (94), 25 states have call predecessors, (94), 26 states have return successors, (95), 91 states have call predecessors, (95), 93 states have call successors, (95) [2024-11-11 20:27:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 907 transitions. [2024-11-11 20:27:06,124 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 907 transitions. Word has length 108 [2024-11-11 20:27:06,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:06,124 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 907 transitions. [2024-11-11 20:27:06,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:27:06,125 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 907 transitions. [2024-11-11 20:27:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-11 20:27:06,128 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:06,128 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:06,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:27:06,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:06,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:06,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1696970047, now seen corresponding path program 1 times [2024-11-11 20:27:06,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:06,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682283518] [2024-11-11 20:27:06,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:06,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:06,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:06,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:06,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:06,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:27:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:06,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:06,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:27:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:06,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:27:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:06,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:06,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:06,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:27:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:06,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:27:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:06,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:06,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:27:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:06,409 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:27:06,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:06,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682283518] [2024-11-11 20:27:06,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682283518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:06,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:27:06,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:27:06,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102931410] [2024-11-11 20:27:06,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:06,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:27:06,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:06,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:27:06,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:27:06,411 INFO L87 Difference]: Start difference. First operand 560 states and 907 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:27:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:09,456 INFO L93 Difference]: Finished difference Result 1290 states and 2101 transitions. [2024-11-11 20:27:09,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:27:09,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-11 20:27:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:09,461 INFO L225 Difference]: With dead ends: 1290 [2024-11-11 20:27:09,462 INFO L226 Difference]: Without dead ends: 791 [2024-11-11 20:27:09,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:27:09,465 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 1335 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 2744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:09,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 1219 Invalid, 2744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 20:27:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-11-11 20:27:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 560. [2024-11-11 20:27:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 439 states have (on average 1.6241457858769932) internal successors, (713), 456 states have internal predecessors, (713), 94 states have call successors, (94), 25 states have call predecessors, (94), 26 states have return successors, (95), 91 states have call predecessors, (95), 93 states have call successors, (95) [2024-11-11 20:27:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 902 transitions. [2024-11-11 20:27:09,561 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 902 transitions. Word has length 108 [2024-11-11 20:27:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:09,562 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 902 transitions. [2024-11-11 20:27:09,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:27:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 902 transitions. [2024-11-11 20:27:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 20:27:09,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:09,565 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:09,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:27:09,566 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:09,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:09,566 INFO L85 PathProgramCache]: Analyzing trace with hash -3668175, now seen corresponding path program 1 times [2024-11-11 20:27:09,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:09,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855968735] [2024-11-11 20:27:09,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:09,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:09,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:09,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:09,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:09,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:27:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:09,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 20:27:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:09,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:27:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:09,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:09,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:09,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:27:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:09,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:27:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:09,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:09,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:27:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:27:09,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:09,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855968735] [2024-11-11 20:27:09,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855968735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:09,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:27:09,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:27:09,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531064727] [2024-11-11 20:27:09,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:09,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:27:09,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:09,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:27:09,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:27:09,919 INFO L87 Difference]: Start difference. First operand 560 states and 902 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:27:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:12,750 INFO L93 Difference]: Finished difference Result 1262 states and 2054 transitions. [2024-11-11 20:27:12,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:27:12,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-11-11 20:27:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:12,755 INFO L225 Difference]: With dead ends: 1262 [2024-11-11 20:27:12,755 INFO L226 Difference]: Without dead ends: 778 [2024-11-11 20:27:12,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:27:12,758 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1331 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 2646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:12,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 1173 Invalid, 2646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 2270 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 20:27:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2024-11-11 20:27:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 562. [2024-11-11 20:27:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 441 states have (on average 1.619047619047619) internal successors, (714), 458 states have internal predecessors, (714), 94 states have call successors, (94), 25 states have call predecessors, (94), 26 states have return successors, (95), 91 states have call predecessors, (95), 93 states have call successors, (95) [2024-11-11 20:27:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 903 transitions. [2024-11-11 20:27:12,884 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 903 transitions. Word has length 109 [2024-11-11 20:27:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:12,884 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 903 transitions. [2024-11-11 20:27:12,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:27:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 903 transitions. [2024-11-11 20:27:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 20:27:12,887 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:12,888 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:12,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:27:12,888 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:12,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:12,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2023739887, now seen corresponding path program 1 times [2024-11-11 20:27:12,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:12,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479400418] [2024-11-11 20:27:12,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:12,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:27:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 20:27:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:27:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:27:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:27:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:27:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:27:13,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:13,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479400418] [2024-11-11 20:27:13,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479400418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:13,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:27:13,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:27:13,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16954929] [2024-11-11 20:27:13,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:13,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:27:13,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:13,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:27:13,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:27:13,172 INFO L87 Difference]: Start difference. First operand 562 states and 903 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:27:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:15,967 INFO L93 Difference]: Finished difference Result 1294 states and 2095 transitions. [2024-11-11 20:27:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:27:15,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-11-11 20:27:15,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:15,972 INFO L225 Difference]: With dead ends: 1294 [2024-11-11 20:27:15,972 INFO L226 Difference]: Without dead ends: 793 [2024-11-11 20:27:15,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:27:15,974 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 1330 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:15,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 1215 Invalid, 2716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 20:27:15,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2024-11-11 20:27:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 562. [2024-11-11 20:27:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 441 states have (on average 1.6077097505668934) internal successors, (709), 458 states have internal predecessors, (709), 94 states have call successors, (94), 25 states have call predecessors, (94), 26 states have return successors, (95), 91 states have call predecessors, (95), 93 states have call successors, (95) [2024-11-11 20:27:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 898 transitions. [2024-11-11 20:27:16,089 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 898 transitions. Word has length 109 [2024-11-11 20:27:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:16,089 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 898 transitions. [2024-11-11 20:27:16,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:27:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 898 transitions. [2024-11-11 20:27:16,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 20:27:16,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:16,093 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:16,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:27:16,093 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:16,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:16,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1371738274, now seen corresponding path program 1 times [2024-11-11 20:27:16,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:16,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844515375] [2024-11-11 20:27:16,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:16,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:16,384 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 38 [2024-11-11 20:27:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 20:27:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:27:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:16,424 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 80 [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 88 [2024-11-11 20:27:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:27:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:27:16,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:16,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844515375] [2024-11-11 20:27:16,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844515375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:16,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:27:16,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:27:16,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658069620] [2024-11-11 20:27:16,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:16,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:27:16,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:16,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:27:16,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:27:16,448 INFO L87 Difference]: Start difference. First operand 562 states and 898 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:27:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:20,386 INFO L93 Difference]: Finished difference Result 1280 states and 2066 transitions. [2024-11-11 20:27:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 20:27:20,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 110 [2024-11-11 20:27:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:20,391 INFO L225 Difference]: With dead ends: 1280 [2024-11-11 20:27:20,391 INFO L226 Difference]: Without dead ends: 791 [2024-11-11 20:27:20,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:27:20,394 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 1317 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 4418 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 4799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 4418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:20,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 2269 Invalid, 4799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 4418 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 20:27:20,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-11-11 20:27:20,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 568. [2024-11-11 20:27:20,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 447 states have (on average 1.5973154362416107) internal successors, (714), 464 states have internal predecessors, (714), 94 states have call successors, (94), 25 states have call predecessors, (94), 26 states have return successors, (95), 91 states have call predecessors, (95), 93 states have call successors, (95) [2024-11-11 20:27:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 903 transitions. [2024-11-11 20:27:20,501 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 903 transitions. Word has length 110 [2024-11-11 20:27:20,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:20,502 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 903 transitions. [2024-11-11 20:27:20,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:27:20,502 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 903 transitions. [2024-11-11 20:27:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 20:27:20,521 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:20,522 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:20,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:27:20,522 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:20,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:20,524 INFO L85 PathProgramCache]: Analyzing trace with hash -236974012, now seen corresponding path program 1 times [2024-11-11 20:27:20,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:20,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216492177] [2024-11-11 20:27:20,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:20,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:27:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 20:27:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:27:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:27:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:27:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:27:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:27:20,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:20,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216492177] [2024-11-11 20:27:20,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216492177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:20,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:27:20,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:27:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035504464] [2024-11-11 20:27:20,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:20,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:27:20,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:20,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:27:20,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:27:20,802 INFO L87 Difference]: Start difference. First operand 568 states and 903 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:27:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:23,678 INFO L93 Difference]: Finished difference Result 1309 states and 2100 transitions. [2024-11-11 20:27:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:27:23,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-11-11 20:27:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:23,683 INFO L225 Difference]: With dead ends: 1309 [2024-11-11 20:27:23,684 INFO L226 Difference]: Without dead ends: 802 [2024-11-11 20:27:23,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:27:23,687 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 1318 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 2697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:23,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 1228 Invalid, 2697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 20:27:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2024-11-11 20:27:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 568. [2024-11-11 20:27:23,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 447 states have (on average 1.5861297539149888) internal successors, (709), 464 states have internal predecessors, (709), 94 states have call successors, (94), 25 states have call predecessors, (94), 26 states have return successors, (95), 91 states have call predecessors, (95), 93 states have call successors, (95) [2024-11-11 20:27:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 898 transitions. [2024-11-11 20:27:23,791 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 898 transitions. Word has length 110 [2024-11-11 20:27:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:23,792 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 898 transitions. [2024-11-11 20:27:23,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:27:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 898 transitions. [2024-11-11 20:27:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:27:23,794 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:23,794 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:23,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:27:23,795 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:23,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:23,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1584929962, now seen corresponding path program 1 times [2024-11-11 20:27:23,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:23,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703695348] [2024-11-11 20:27:23,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:23,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:24,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:24,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:24,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:24,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:27:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:24,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:24,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:27:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:27:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:24,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:24,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:24,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:27:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:24,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:27:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:24,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:24,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:27:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:27:24,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:24,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703695348] [2024-11-11 20:27:24,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703695348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:24,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:27:24,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:27:24,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988815069] [2024-11-11 20:27:24,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:24,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:27:24,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:24,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:27:24,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:27:24,124 INFO L87 Difference]: Start difference. First operand 568 states and 898 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:27:26,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:26,943 INFO L93 Difference]: Finished difference Result 1291 states and 2069 transitions. [2024-11-11 20:27:26,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:27:26,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-11-11 20:27:26,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:26,949 INFO L225 Difference]: With dead ends: 1291 [2024-11-11 20:27:26,949 INFO L226 Difference]: Without dead ends: 799 [2024-11-11 20:27:26,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:27:26,952 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 1308 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 2616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:26,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 1199 Invalid, 2616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 20:27:26,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-11 20:27:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2024-11-11 20:27:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 455 states have (on average 1.5736263736263736) internal successors, (716), 472 states have internal predecessors, (716), 94 states have call successors, (94), 25 states have call predecessors, (94), 26 states have return successors, (95), 91 states have call predecessors, (95), 93 states have call successors, (95) [2024-11-11 20:27:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 905 transitions. [2024-11-11 20:27:27,054 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 905 transitions. Word has length 111 [2024-11-11 20:27:27,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:27,055 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 905 transitions. [2024-11-11 20:27:27,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:27:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 905 transitions. [2024-11-11 20:27:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:27:27,058 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:27,058 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:27,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:27:27,059 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:27,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:27,059 INFO L85 PathProgramCache]: Analyzing trace with hash 482850102, now seen corresponding path program 1 times [2024-11-11 20:27:27,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:27,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302618878] [2024-11-11 20:27:27,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:27,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:27:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:27:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:27:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:27:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:27:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:27:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:27:27,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:27,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302618878] [2024-11-11 20:27:27,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302618878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:27,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:27:27,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:27:27,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299120509] [2024-11-11 20:27:27,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:27,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:27:27,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:27,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:27:27,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:27:27,368 INFO L87 Difference]: Start difference. First operand 576 states and 905 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:27:30,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:30,226 INFO L93 Difference]: Finished difference Result 1350 states and 2137 transitions. [2024-11-11 20:27:30,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:27:30,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-11-11 20:27:30,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:30,232 INFO L225 Difference]: With dead ends: 1350 [2024-11-11 20:27:30,232 INFO L226 Difference]: Without dead ends: 771 [2024-11-11 20:27:30,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:27:30,235 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 1274 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 2648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:30,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 1180 Invalid, 2648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 20:27:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-11-11 20:27:30,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 557. [2024-11-11 20:27:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 439 states have (on average 1.5785876993166288) internal successors, (693), 454 states have internal predecessors, (693), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-11 20:27:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 878 transitions. [2024-11-11 20:27:30,326 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 878 transitions. Word has length 111 [2024-11-11 20:27:30,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:30,326 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 878 transitions. [2024-11-11 20:27:30,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:27:30,327 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 878 transitions. [2024-11-11 20:27:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 20:27:30,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:30,329 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:30,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:27:30,329 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:30,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:30,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1396959961, now seen corresponding path program 1 times [2024-11-11 20:27:30,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:30,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73169561] [2024-11-11 20:27:30,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:30,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:27:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 20:27:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:27:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:27:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:27:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:27:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:27:30,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:30,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73169561] [2024-11-11 20:27:30,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73169561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:30,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:27:30,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:27:30,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053961522] [2024-11-11 20:27:30,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:30,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:27:30,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:30,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:27:30,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:27:30,680 INFO L87 Difference]: Start difference. First operand 557 states and 878 transitions. Second operand has 9 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:27:34,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:34,385 INFO L93 Difference]: Finished difference Result 1279 states and 2041 transitions. [2024-11-11 20:27:34,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 20:27:34,386 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 112 [2024-11-11 20:27:34,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:34,391 INFO L225 Difference]: With dead ends: 1279 [2024-11-11 20:27:34,391 INFO L226 Difference]: Without dead ends: 786 [2024-11-11 20:27:34,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:27:34,394 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 1286 mSDsluCounter, 1894 mSDsCounter, 0 mSdLazyCounter, 4314 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 4693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 4314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:34,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 2250 Invalid, 4693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 4314 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 20:27:34,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-11 20:27:34,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 567. [2024-11-11 20:27:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 449 states have (on average 1.5657015590200445) internal successors, (703), 464 states have internal predecessors, (703), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-11 20:27:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 888 transitions. [2024-11-11 20:27:34,504 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 888 transitions. Word has length 112 [2024-11-11 20:27:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:34,504 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 888 transitions. [2024-11-11 20:27:34,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:27:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 888 transitions. [2024-11-11 20:27:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 20:27:34,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:34,506 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:34,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:27:34,506 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:34,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:34,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1570740619, now seen corresponding path program 1 times [2024-11-11 20:27:34,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:34,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108244684] [2024-11-11 20:27:34,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:34,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:34,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:34,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:34,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:34,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:34,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:34,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:27:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:34,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:27:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:34,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:34,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:34,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:27:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:34,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:27:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:34,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:34,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:27:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:27:34,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:34,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108244684] [2024-11-11 20:27:34,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108244684] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:27:34,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716999033] [2024-11-11 20:27:34,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:34,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:34,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:27:34,798 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:34,799 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:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:35,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:27:35,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:27:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 20:27:35,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:27:35,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716999033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:35,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:27:35,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-11 20:27:35,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835147578] [2024-11-11 20:27:35,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:35,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:27:35,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:35,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:27:35,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:27:35,125 INFO L87 Difference]: Start difference. First operand 567 states and 888 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:27:35,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:35,387 INFO L93 Difference]: Finished difference Result 1544 states and 2497 transitions. [2024-11-11 20:27:35,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:27:35,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2024-11-11 20:27:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:35,393 INFO L225 Difference]: With dead ends: 1544 [2024-11-11 20:27:35,394 INFO L226 Difference]: Without dead ends: 1053 [2024-11-11 20:27:35,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:27:35,397 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 829 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1680 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:35,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1680 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:35,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-11-11 20:27:35,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1046. [2024-11-11 20:27:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 822 states have (on average 1.5924574209245743) internal successors, (1309), 850 states have internal predecessors, (1309), 178 states have call successors, (178), 46 states have call predecessors, (178), 45 states have return successors, (188), 175 states have call predecessors, (188), 176 states have call successors, (188) [2024-11-11 20:27:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1675 transitions. [2024-11-11 20:27:35,620 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1675 transitions. Word has length 113 [2024-11-11 20:27:35,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:35,621 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1675 transitions. [2024-11-11 20:27:35,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:27:35,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1675 transitions. [2024-11-11 20:27:35,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 20:27:35,623 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:35,623 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:35,644 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:35,824 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,SelfDestructingSolverStorable16 [2024-11-11 20:27:35,824 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:35,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:35,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1508701005, now seen corresponding path program 1 times [2024-11-11 20:27:35,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:35,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766755901] [2024-11-11 20:27:35,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:35,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:36,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:36,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:36,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:36,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:36,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:36,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:27:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:36,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:27:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:36,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:36,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:36,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:27:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:36,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:27:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:36,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:36,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:27:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:27:36,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:36,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766755901] [2024-11-11 20:27:36,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766755901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:27:36,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434887036] [2024-11-11 20:27:36,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:36,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:36,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:27:36,137 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:36,139 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:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:36,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 20:27:36,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:27:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:27:36,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:27:36,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434887036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:36,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:27:36,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-11 20:27:36,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231756353] [2024-11-11 20:27:36,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:36,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:27:36,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:36,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:27:36,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:27:36,532 INFO L87 Difference]: Start difference. First operand 1046 states and 1675 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:27:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:37,142 INFO L93 Difference]: Finished difference Result 2032 states and 3335 transitions. [2024-11-11 20:27:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:27:37,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2024-11-11 20:27:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:37,148 INFO L225 Difference]: With dead ends: 2032 [2024-11-11 20:27:37,148 INFO L226 Difference]: Without dead ends: 1062 [2024-11-11 20:27:37,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:27:37,155 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 798 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:37,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 2078 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 20:27:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2024-11-11 20:27:37,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2024-11-11 20:27:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 836 states have (on average 1.5944976076555024) internal successors, (1333), 864 states have internal predecessors, (1333), 178 states have call successors, (178), 48 states have call predecessors, (178), 47 states have return successors, (190), 175 states have call predecessors, (190), 176 states have call successors, (190) [2024-11-11 20:27:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1701 transitions. [2024-11-11 20:27:37,347 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1701 transitions. Word has length 113 [2024-11-11 20:27:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:37,348 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1701 transitions. [2024-11-11 20:27:37,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:27:37,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1701 transitions. [2024-11-11 20:27:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 20:27:37,350 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:37,350 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:37,364 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:37,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 20:27:37,551 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:37,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:37,551 INFO L85 PathProgramCache]: Analyzing trace with hash 634660036, now seen corresponding path program 1 times [2024-11-11 20:27:37,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:37,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588319046] [2024-11-11 20:27:37,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:37,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:37,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:37,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:37,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:37,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:37,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:37,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:27:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:37,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:27:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:37,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:37,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:37,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:27:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:37,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:27:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:37,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:37,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:27:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 20:27:37,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:37,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588319046] [2024-11-11 20:27:37,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588319046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:27:37,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334884681] [2024-11-11 20:27:37,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:37,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:37,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:27:37,818 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:37,820 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:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:38,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 20:27:38,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:27:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 20:27:38,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:27:38,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334884681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:38,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:27:38,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-11 20:27:38,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893066431] [2024-11-11 20:27:38,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:38,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:27:38,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:38,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:27:38,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:27:38,203 INFO L87 Difference]: Start difference. First operand 1062 states and 1701 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:27:38,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:38,738 INFO L93 Difference]: Finished difference Result 2064 states and 3381 transitions. [2024-11-11 20:27:38,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:27:38,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-11-11 20:27:38,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:38,744 INFO L225 Difference]: With dead ends: 2064 [2024-11-11 20:27:38,744 INFO L226 Difference]: Without dead ends: 1078 [2024-11-11 20:27:38,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:27:38,750 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 785 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:38,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 2075 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 20:27:38,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2024-11-11 20:27:38,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1078. [2024-11-11 20:27:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 850 states have (on average 1.596470588235294) internal successors, (1357), 878 states have internal predecessors, (1357), 178 states have call successors, (178), 50 states have call predecessors, (178), 49 states have return successors, (192), 175 states have call predecessors, (192), 176 states have call successors, (192) [2024-11-11 20:27:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1727 transitions. [2024-11-11 20:27:38,999 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1727 transitions. Word has length 116 [2024-11-11 20:27:38,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:38,999 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1727 transitions. [2024-11-11 20:27:38,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:27:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1727 transitions. [2024-11-11 20:27:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 20:27:39,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:39,001 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:39,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 20:27:39,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:39,202 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:39,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:39,203 INFO L85 PathProgramCache]: Analyzing trace with hash -198476695, now seen corresponding path program 1 times [2024-11-11 20:27:39,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:39,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347567637] [2024-11-11 20:27:39,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:39,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:39,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:39,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:39,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:39,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:27:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:39,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:27:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:39,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:39,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:39,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:27:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:39,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:27:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:39,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:39,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:27:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 20:27:39,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:39,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347567637] [2024-11-11 20:27:39,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347567637] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:27:39,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012643304] [2024-11-11 20:27:39,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:39,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:39,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:27:39,482 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:39,484 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:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:39,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 1222 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 20:27:39,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:27:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 20:27:39,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:27:39,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012643304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:39,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:27:39,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-11 20:27:39,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212776924] [2024-11-11 20:27:39,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:39,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:27:39,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:27:39,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:27:39,852 INFO L87 Difference]: Start difference. First operand 1078 states and 1727 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:27:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:40,386 INFO L93 Difference]: Finished difference Result 2096 states and 3427 transitions. [2024-11-11 20:27:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:27:40,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-11-11 20:27:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:40,393 INFO L225 Difference]: With dead ends: 2096 [2024-11-11 20:27:40,393 INFO L226 Difference]: Without dead ends: 1094 [2024-11-11 20:27:40,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:27:40,399 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 773 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:40,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 2072 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:27:40,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2024-11-11 20:27:40,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1094. [2024-11-11 20:27:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 864 states have (on average 1.5983796296296295) internal successors, (1381), 892 states have internal predecessors, (1381), 178 states have call successors, (178), 52 states have call predecessors, (178), 51 states have return successors, (194), 175 states have call predecessors, (194), 176 states have call successors, (194) [2024-11-11 20:27:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1753 transitions. [2024-11-11 20:27:40,552 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1753 transitions. Word has length 119 [2024-11-11 20:27:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:40,552 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1753 transitions. [2024-11-11 20:27:40,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:27:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1753 transitions. [2024-11-11 20:27:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-11 20:27:40,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:40,554 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:40,569 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:40,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:40,755 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:40,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:40,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1638157160, now seen corresponding path program 1 times [2024-11-11 20:27:40,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:40,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472614081] [2024-11-11 20:27:40,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:40,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:40,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:40,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:40,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:40,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:40,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:27:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:27:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:27:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:27:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:27:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:27:41,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:41,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472614081] [2024-11-11 20:27:41,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472614081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:27:41,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335765747] [2024-11-11 20:27:41,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:41,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:41,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:27:41,039 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:41,040 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:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:41,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 20:27:41,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:27:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:27:41,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:27:41,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335765747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:41,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:27:41,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-11 20:27:41,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984235944] [2024-11-11 20:27:41,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:41,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:27:41,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:41,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:27:41,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:27:41,392 INFO L87 Difference]: Start difference. First operand 1094 states and 1753 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:27:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:41,993 INFO L93 Difference]: Finished difference Result 2128 states and 3473 transitions. [2024-11-11 20:27:41,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:27:41,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-11 20:27:41,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:42,000 INFO L225 Difference]: With dead ends: 2128 [2024-11-11 20:27:42,001 INFO L226 Difference]: Without dead ends: 1110 [2024-11-11 20:27:42,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:27:42,008 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 780 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:42,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 2069 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:27:42,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2024-11-11 20:27:42,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2024-11-11 20:27:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 878 states have (on average 1.6002277904328017) internal successors, (1405), 906 states have internal predecessors, (1405), 178 states have call successors, (178), 54 states have call predecessors, (178), 53 states have return successors, (196), 175 states have call predecessors, (196), 176 states have call successors, (196) [2024-11-11 20:27:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1779 transitions. [2024-11-11 20:27:42,168 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1779 transitions. Word has length 122 [2024-11-11 20:27:42,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:42,169 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1779 transitions. [2024-11-11 20:27:42,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:27:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1779 transitions. [2024-11-11 20:27:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-11 20:27:42,170 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:42,170 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:42,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 20:27:42,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:42,371 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:42,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:42,371 INFO L85 PathProgramCache]: Analyzing trace with hash 133963653, now seen corresponding path program 1 times [2024-11-11 20:27:42,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:42,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262665873] [2024-11-11 20:27:42,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:42,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:42,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:42,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:42,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:42,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:42,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:27:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:42,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:27:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:42,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:42,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:42,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:27:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:42,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:27:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:42,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:42,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:27:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:42,915 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:42,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:42,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262665873] [2024-11-11 20:27:42,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262665873] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:27:42,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47792350] [2024-11-11 20:27:42,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:42,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:42,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:27:42,917 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:42,918 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:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:43,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-11 20:27:43,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:27:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 20:27:43,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:27:43,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47792350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:43,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:27:43,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2024-11-11 20:27:43,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945662711] [2024-11-11 20:27:43,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:43,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:27:43,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:43,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:27:43,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:27:43,371 INFO L87 Difference]: Start difference. First operand 1110 states and 1779 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:27:43,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:43,986 INFO L93 Difference]: Finished difference Result 2154 states and 3489 transitions. [2024-11-11 20:27:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:27:43,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 125 [2024-11-11 20:27:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:43,994 INFO L225 Difference]: With dead ends: 2154 [2024-11-11 20:27:43,994 INFO L226 Difference]: Without dead ends: 1120 [2024-11-11 20:27:44,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:27:44,000 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 745 mSDsluCounter, 2775 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 3625 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:44,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 3625 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 20:27:44,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2024-11-11 20:27:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1113. [2024-11-11 20:27:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 880 states have (on average 1.5988636363636364) internal successors, (1407), 909 states have internal predecessors, (1407), 178 states have call successors, (178), 54 states have call predecessors, (178), 54 states have return successors, (197), 175 states have call predecessors, (197), 176 states have call successors, (197) [2024-11-11 20:27:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1782 transitions. [2024-11-11 20:27:44,187 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1782 transitions. Word has length 125 [2024-11-11 20:27:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:44,187 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1782 transitions. [2024-11-11 20:27:44,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:27:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1782 transitions. [2024-11-11 20:27:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-11 20:27:44,190 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:44,190 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:44,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 20:27:44,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:44,391 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:27:44,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:27:44,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1447064827, now seen corresponding path program 1 times [2024-11-11 20:27:44,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:27:44,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880360963] [2024-11-11 20:27:44,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:44,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:27:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:44,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:27:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:44,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:44,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:27:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:44,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:27:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:44,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:44,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:27:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:44,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:27:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:44,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:44,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:44,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:27:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:44,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:27:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:44,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:27:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:44,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:27:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:44,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:27:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:27:44,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:27:44,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880360963] [2024-11-11 20:27:44,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880360963] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:27:44,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706000063] [2024-11-11 20:27:44,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:27:44,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:27:44,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:27:44,925 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:44,927 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:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:27:45,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 1224 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-11 20:27:45,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:27:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 20:27:45,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:27:45,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706000063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:27:45,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:27:45,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-11 20:27:45,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933255235] [2024-11-11 20:27:45,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:27:45,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:27:45,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:27:45,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:27:45,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:27:45,360 INFO L87 Difference]: Start difference. First operand 1113 states and 1782 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:27:45,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:27:45,826 INFO L93 Difference]: Finished difference Result 2168 states and 3527 transitions. [2024-11-11 20:27:45,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:27:45,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2024-11-11 20:27:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:27:45,832 INFO L225 Difference]: With dead ends: 2168 [2024-11-11 20:27:45,832 INFO L226 Difference]: Without dead ends: 1131 [2024-11-11 20:27:45,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:27:45,835 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 763 mSDsluCounter, 2297 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 3162 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:27:45,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 3162 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:27:45,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2024-11-11 20:27:45,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1123. [2024-11-11 20:27:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 886 states have (on average 1.5948081264108351) internal successors, (1413), 918 states have internal predecessors, (1413), 180 states have call successors, (180), 55 states have call predecessors, (180), 56 states have return successors, (207), 175 states have call predecessors, (207), 178 states have call successors, (207) [2024-11-11 20:27:45,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1800 transitions. [2024-11-11 20:27:45,986 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1800 transitions. Word has length 127 [2024-11-11 20:27:45,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:27:45,986 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1800 transitions. [2024-11-11 20:27:45,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:27:45,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1800 transitions. [2024-11-11 20:27:45,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-11 20:27:45,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:27:45,990 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:27:46,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0