./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product17.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product17.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c169527384ebd2beb44494ef6b1cbc32334198d2b76d2236e6ced79c84ed026c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:37:01,361 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:37:01,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:37:01,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:37:01,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:37:01,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:37:01,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:37:01,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:37:01,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:37:01,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:37:01,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:37:01,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:37:01,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:37:01,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:37:01,477 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:37:01,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:37:01,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:37:01,478 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:37:01,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:37:01,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:37:01,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:37:01,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:37:01,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:37:01,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:37:01,481 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:37:01,481 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:37:01,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:37:01,482 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:37:01,482 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:37:01,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:37:01,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:37:01,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:37:01,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:37:01,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:37:01,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:37:01,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:37:01,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:37:01,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:37:01,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:37:01,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:37:01,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:37:01,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:37:01,489 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c169527384ebd2beb44494ef6b1cbc32334198d2b76d2236e6ced79c84ed026c [2024-10-11 02:37:01,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:37:01,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:37:01,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:37:01,751 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:37:01,752 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:37:01,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product17.cil.c [2024-10-11 02:37:03,202 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:37:03,493 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:37:03,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product17.cil.c [2024-10-11 02:37:03,526 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1f5d46992/415c1454bb354759ae275bdea4ee8976/FLAG8ffbe84ba [2024-10-11 02:37:03,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1f5d46992/415c1454bb354759ae275bdea4ee8976 [2024-10-11 02:37:03,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:37:03,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:37:03,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:37:03,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:37:03,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:37:03,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:37:03" (1/1) ... [2024-10-11 02:37:03,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5888a638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:03, skipping insertion in model container [2024-10-11 02:37:03,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:37:03" (1/1) ... [2024-10-11 02:37:03,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:37:03,901 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product17.cil.c[5770,5783] [2024-10-11 02:37:04,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:37:04,205 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:37:04,214 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2024-10-11 02:37:04,216 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [67] [2024-10-11 02:37:04,216 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [259] [2024-10-11 02:37:04,217 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [268] [2024-10-11 02:37:04,217 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [366] [2024-10-11 02:37:04,217 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1033] [2024-10-11 02:37:04,217 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1399] [2024-10-11 02:37:04,217 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2844] [2024-10-11 02:37:04,217 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3195] [2024-10-11 02:37:04,218 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3313] [2024-10-11 02:37:04,230 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product17.cil.c[5770,5783] [2024-10-11 02:37:04,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:37:04,345 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:37:04,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:04 WrapperNode [2024-10-11 02:37:04,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:37:04,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:37:04,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:37:04,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:37:04,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:04" (1/1) ... [2024-10-11 02:37:04,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:04" (1/1) ... [2024-10-11 02:37:04,435 INFO L138 Inliner]: procedures = 88, calls = 338, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 797 [2024-10-11 02:37:04,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:37:04,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:37:04,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:37:04,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:37:04,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:04" (1/1) ... [2024-10-11 02:37:04,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:04" (1/1) ... [2024-10-11 02:37:04,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:04" (1/1) ... [2024-10-11 02:37:04,485 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-11 02:37:04,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:04" (1/1) ... [2024-10-11 02:37:04,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:04" (1/1) ... [2024-10-11 02:37:04,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:04" (1/1) ... [2024-10-11 02:37:04,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:04" (1/1) ... [2024-10-11 02:37:04,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:04" (1/1) ... [2024-10-11 02:37:04,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:04" (1/1) ... [2024-10-11 02:37:04,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:37:04,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:37:04,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:37:04,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:37:04,579 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:04" (1/1) ... [2024-10-11 02:37:04,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:37:04,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:37:04,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:37:04,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:37:04,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:37:04,672 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-10-11 02:37:04,672 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-10-11 02:37:04,673 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:37:04,673 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:37:04,673 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:37:04,673 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:37:04,673 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:37:04,674 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:37:04,674 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-11 02:37:04,674 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-11 02:37:04,675 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:37:04,675 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:37:04,675 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:37:04,675 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:37:04,676 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:37:04,676 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:37:04,676 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:37:04,676 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:37:04,676 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:37:04,677 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:37:04,677 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:37:04,677 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:37:04,677 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:37:04,678 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:37:04,678 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-10-11 02:37:04,678 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-10-11 02:37:04,678 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:37:04,679 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:37:04,679 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-10-11 02:37:04,679 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-10-11 02:37:04,679 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:37:04,679 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:37:04,679 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:37:04,680 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:37:04,680 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:37:04,680 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:37:04,681 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:37:04,681 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:37:04,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:37:04,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:37:04,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:37:04,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:37:04,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:37:04,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:37:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:37:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:37:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:37:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:37:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:37:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:37:04,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:37:04,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:37:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:37:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:37:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:37:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:37:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:37:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:37:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-11 02:37:04,685 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-11 02:37:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:37:04,685 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:37:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:37:04,685 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:37:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:37:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:37:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:37:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:37:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:37:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:37:04,888 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:37:04,891 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:37:06,042 INFO L? ?]: Removed 435 outVars from TransFormulas that were not future-live. [2024-10-11 02:37:06,042 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:37:06,127 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:37:06,128 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:37:06,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:37:06 BoogieIcfgContainer [2024-10-11 02:37:06,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:37:06,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:37:06,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:37:06,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:37:06,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:37:03" (1/3) ... [2024-10-11 02:37:06,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ade28ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:37:06, skipping insertion in model container [2024-10-11 02:37:06,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:04" (2/3) ... [2024-10-11 02:37:06,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ade28ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:37:06, skipping insertion in model container [2024-10-11 02:37:06,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:37:06" (3/3) ... [2024-10-11 02:37:06,176 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product17.cil.c [2024-10-11 02:37:06,191 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:37:06,191 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:37:06,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:37:06,275 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;@d005406, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:37:06,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:37:06,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 540 states, 414 states have (on average 1.7222222222222223) internal successors, (713), 432 states have internal predecessors, (713), 100 states have call successors, (100), 24 states have call predecessors, (100), 24 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-11 02:37:06,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 02:37:06,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:06,304 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 02:37:06,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:06,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:06,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1984493230, now seen corresponding path program 1 times [2024-10-11 02:37:06,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:06,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020138565] [2024-10-11 02:37:06,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:06,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:37:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:37:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:37:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:37:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:37:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:07,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:07,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020138565] [2024-10-11 02:37:07,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020138565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:07,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:07,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:07,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421118899] [2024-10-11 02:37:07,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:07,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:07,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:07,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:07,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:07,907 INFO L87 Difference]: Start difference. First operand has 540 states, 414 states have (on average 1.7222222222222223) internal successors, (713), 432 states have internal predecessors, (713), 100 states have call successors, (100), 24 states have call predecessors, (100), 24 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:15,870 INFO L93 Difference]: Finished difference Result 1418 states and 2501 transitions. [2024-10-11 02:37:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:37:15,873 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 75 [2024-10-11 02:37:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:15,909 INFO L225 Difference]: With dead ends: 1418 [2024-10-11 02:37:15,910 INFO L226 Difference]: Without dead ends: 875 [2024-10-11 02:37:15,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:37:15,926 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 2161 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 5319 mSolverCounterSat, 659 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 2843 SdHoareTripleChecker+Invalid, 5978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 659 IncrementalHoareTripleChecker+Valid, 5319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:15,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2266 Valid, 2843 Invalid, 5978 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [659 Valid, 5319 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-11 02:37:15,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-11 02:37:16,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 546. [2024-10-11 02:37:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 420 states have (on average 1.707142857142857) internal successors, (717), 438 states have internal predecessors, (717), 101 states have call successors, (101), 24 states have call predecessors, (101), 24 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-10-11 02:37:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 918 transitions. [2024-10-11 02:37:16,216 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 918 transitions. Word has length 75 [2024-10-11 02:37:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:16,218 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 918 transitions. [2024-10-11 02:37:16,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 918 transitions. [2024-10-11 02:37:16,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 02:37:16,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:16,227 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 02:37:16,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:37:16,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:16,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1486008158, now seen corresponding path program 1 times [2024-10-11 02:37:16,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:16,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191779926] [2024-10-11 02:37:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:16,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:37:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:37:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:37:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:37:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:37:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:16,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:16,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191779926] [2024-10-11 02:37:16,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191779926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:16,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:16,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:16,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968269464] [2024-10-11 02:37:16,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:16,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:16,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:16,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:16,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:16,944 INFO L87 Difference]: Start difference. First operand 546 states and 918 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:23,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:23,680 INFO L93 Difference]: Finished difference Result 1411 states and 2450 transitions. [2024-10-11 02:37:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:37:23,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 76 [2024-10-11 02:37:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:23,688 INFO L225 Difference]: With dead ends: 1411 [2024-10-11 02:37:23,689 INFO L226 Difference]: Without dead ends: 875 [2024-10-11 02:37:23,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:37:23,694 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 1051 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 5417 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 2827 SdHoareTripleChecker+Invalid, 5692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 5417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:23,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 2827 Invalid, 5692 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [275 Valid, 5417 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-11 02:37:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-11 02:37:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 546. [2024-10-11 02:37:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 420 states have (on average 1.7047619047619047) internal successors, (716), 438 states have internal predecessors, (716), 101 states have call successors, (101), 24 states have call predecessors, (101), 24 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-10-11 02:37:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 917 transitions. [2024-10-11 02:37:23,829 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 917 transitions. Word has length 76 [2024-10-11 02:37:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:23,829 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 917 transitions. [2024-10-11 02:37:23,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 917 transitions. [2024-10-11 02:37:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 02:37:23,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:23,833 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 02:37:23,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:37:23,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:23,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:23,835 INFO L85 PathProgramCache]: Analyzing trace with hash 25252281, now seen corresponding path program 1 times [2024-10-11 02:37:23,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:23,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352622175] [2024-10-11 02:37:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:23,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:24,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:24,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:24,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:24,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:24,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:37:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:24,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:37:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:24,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:37:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:24,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:37:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:24,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:37:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:24,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:37:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:24,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:24,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352622175] [2024-10-11 02:37:24,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352622175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:24,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:24,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:37:24,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297750695] [2024-10-11 02:37:24,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:24,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:37:24,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:24,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:37:24,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:37:24,403 INFO L87 Difference]: Start difference. First operand 546 states and 917 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:37:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:29,364 INFO L93 Difference]: Finished difference Result 1405 states and 2433 transitions. [2024-10-11 02:37:29,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:37:29,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 76 [2024-10-11 02:37:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:29,371 INFO L225 Difference]: With dead ends: 1405 [2024-10-11 02:37:29,371 INFO L226 Difference]: Without dead ends: 840 [2024-10-11 02:37:29,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:37:29,377 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 1541 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 2839 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1645 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 2839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:29,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1645 Valid, 1504 Invalid, 3311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 2839 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-11 02:37:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-10-11 02:37:29,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 523. [2024-10-11 02:37:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 400 states have (on average 1.695) internal successors, (678), 416 states have internal predecessors, (678), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-11 02:37:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 875 transitions. [2024-10-11 02:37:29,504 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 875 transitions. Word has length 76 [2024-10-11 02:37:29,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:29,504 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 875 transitions. [2024-10-11 02:37:29,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:37:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 875 transitions. [2024-10-11 02:37:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 02:37:29,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:29,507 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 02:37:29,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:37:29,508 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:29,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:29,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1640512262, now seen corresponding path program 1 times [2024-10-11 02:37:29,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:29,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026281886] [2024-10-11 02:37:29,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:29,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:29,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:37:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:37:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:37:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:37:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:37:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:30,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:30,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026281886] [2024-10-11 02:37:30,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026281886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:30,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:30,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:30,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297674315] [2024-10-11 02:37:30,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:30,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:30,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:30,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:30,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:30,209 INFO L87 Difference]: Start difference. First operand 523 states and 875 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:36,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:36,325 INFO L93 Difference]: Finished difference Result 1369 states and 2365 transitions. [2024-10-11 02:37:36,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:37:36,326 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 77 [2024-10-11 02:37:36,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:36,332 INFO L225 Difference]: With dead ends: 1369 [2024-10-11 02:37:36,333 INFO L226 Difference]: Without dead ends: 834 [2024-10-11 02:37:36,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:37:36,337 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 1568 mSDsluCounter, 2344 mSDsCounter, 0 mSdLazyCounter, 5122 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 2779 SdHoareTripleChecker+Invalid, 5593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 5122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:36,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 2779 Invalid, 5593 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [471 Valid, 5122 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 02:37:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-10-11 02:37:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 517. [2024-10-11 02:37:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 394 states have (on average 1.6878172588832487) internal successors, (665), 410 states have internal predecessors, (665), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-11 02:37:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 862 transitions. [2024-10-11 02:37:36,484 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 862 transitions. Word has length 77 [2024-10-11 02:37:36,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:36,485 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 862 transitions. [2024-10-11 02:37:36,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 862 transitions. [2024-10-11 02:37:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 02:37:36,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:36,487 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 02:37:36,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:37:36,488 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:36,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:36,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1083816198, now seen corresponding path program 1 times [2024-10-11 02:37:36,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:36,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614098172] [2024-10-11 02:37:36,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:36,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:36,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:36,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:36,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:37:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:37:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:37:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:37:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:37:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:37,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:37,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614098172] [2024-10-11 02:37:37,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614098172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:37,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:37,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:37:37,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041072610] [2024-10-11 02:37:37,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:37,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:37:37,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:37,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:37:37,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:37:37,096 INFO L87 Difference]: Start difference. First operand 517 states and 862 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:37:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:41,744 INFO L93 Difference]: Finished difference Result 1341 states and 2316 transitions. [2024-10-11 02:37:41,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:37:41,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 78 [2024-10-11 02:37:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:41,752 INFO L225 Difference]: With dead ends: 1341 [2024-10-11 02:37:41,752 INFO L226 Difference]: Without dead ends: 834 [2024-10-11 02:37:41,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:37:41,755 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 994 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 2785 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 2785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:41,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1512 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 2785 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 02:37:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-10-11 02:37:41,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 517. [2024-10-11 02:37:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 394 states have (on average 1.6852791878172588) internal successors, (664), 410 states have internal predecessors, (664), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-11 02:37:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 861 transitions. [2024-10-11 02:37:41,923 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 861 transitions. Word has length 78 [2024-10-11 02:37:41,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:41,924 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 861 transitions. [2024-10-11 02:37:41,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:37:41,924 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 861 transitions. [2024-10-11 02:37:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 02:37:41,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:41,927 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 02:37:41,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:37:41,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:41,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:41,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2033674199, now seen corresponding path program 1 times [2024-10-11 02:37:41,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:41,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678670846] [2024-10-11 02:37:41,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:41,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:37:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 02:37:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:37:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:37:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:37:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:42,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678670846] [2024-10-11 02:37:42,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678670846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:42,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:42,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:42,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950567913] [2024-10-11 02:37:42,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:42,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:42,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:42,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:42,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:42,568 INFO L87 Difference]: Start difference. First operand 517 states and 861 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:48,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:48,270 INFO L93 Difference]: Finished difference Result 1357 states and 2334 transitions. [2024-10-11 02:37:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:37:48,271 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 79 [2024-10-11 02:37:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:48,276 INFO L225 Difference]: With dead ends: 1357 [2024-10-11 02:37:48,276 INFO L226 Difference]: Without dead ends: 828 [2024-10-11 02:37:48,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:37:48,280 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 1529 mSDsluCounter, 2360 mSDsCounter, 0 mSdLazyCounter, 5038 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 5507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 5038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:48,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 2798 Invalid, 5507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 5038 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 02:37:48,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-10-11 02:37:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 511. [2024-10-11 02:37:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 388 states have (on average 1.6778350515463918) internal successors, (651), 404 states have internal predecessors, (651), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-11 02:37:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 848 transitions. [2024-10-11 02:37:48,415 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 848 transitions. Word has length 79 [2024-10-11 02:37:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:48,415 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 848 transitions. [2024-10-11 02:37:48,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:48,416 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 848 transitions. [2024-10-11 02:37:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 02:37:48,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:48,418 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 02:37:48,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:37:48,418 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:48,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1404947719, now seen corresponding path program 1 times [2024-10-11 02:37:48,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:48,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308112932] [2024-10-11 02:37:48,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:48,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:48,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:48,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:48,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:48,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:48,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:48,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:37:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:48,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:37:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:37:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:48,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:37:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:48,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:37:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:48,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:48,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:48,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308112932] [2024-10-11 02:37:48,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308112932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:48,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:48,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:37:48,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812325856] [2024-10-11 02:37:48,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:48,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:37:48,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:48,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:37:48,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:37:48,973 INFO L87 Difference]: Start difference. First operand 511 states and 848 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:37:53,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:53,410 INFO L93 Difference]: Finished difference Result 1329 states and 2287 transitions. [2024-10-11 02:37:53,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:37:53,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 80 [2024-10-11 02:37:53,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:53,416 INFO L225 Difference]: With dead ends: 1329 [2024-10-11 02:37:53,416 INFO L226 Difference]: Without dead ends: 828 [2024-10-11 02:37:53,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:37:53,419 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 974 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 2744 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 3019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:53,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 1494 Invalid, 3019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2744 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-11 02:37:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-10-11 02:37:53,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 511. [2024-10-11 02:37:53,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 388 states have (on average 1.675257731958763) internal successors, (650), 404 states have internal predecessors, (650), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-11 02:37:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 847 transitions. [2024-10-11 02:37:53,569 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 847 transitions. Word has length 80 [2024-10-11 02:37:53,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:53,570 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 847 transitions. [2024-10-11 02:37:53,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:37:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 847 transitions. [2024-10-11 02:37:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 02:37:53,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:53,572 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 02:37:53,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:37:53,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:53,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:53,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1933882501, now seen corresponding path program 1 times [2024-10-11 02:37:53,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:53,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079450671] [2024-10-11 02:37:53,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:53,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:53,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:54,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:54,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:54,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:54,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:54,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:37:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:54,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:37:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:54,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:37:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:54,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:37:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:54,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:37:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:54,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:54,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079450671] [2024-10-11 02:37:54,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079450671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:54,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:54,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:54,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364614959] [2024-10-11 02:37:54,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:54,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:54,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:54,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:54,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:54,165 INFO L87 Difference]: Start difference. First operand 511 states and 847 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:37:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:59,822 INFO L93 Difference]: Finished difference Result 1345 states and 2303 transitions. [2024-10-11 02:37:59,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:37:59,823 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 81 [2024-10-11 02:37:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:59,828 INFO L225 Difference]: With dead ends: 1345 [2024-10-11 02:37:59,828 INFO L226 Difference]: Without dead ends: 822 [2024-10-11 02:37:59,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:37:59,831 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 1507 mSDsluCounter, 2280 mSDsCounter, 0 mSdLazyCounter, 4939 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1612 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 5408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 4939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:59,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1612 Valid, 2703 Invalid, 5408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 4939 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 02:37:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-10-11 02:37:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 505. [2024-10-11 02:37:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 382 states have (on average 1.6675392670157068) internal successors, (637), 398 states have internal predecessors, (637), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-11 02:38:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 834 transitions. [2024-10-11 02:38:00,001 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 834 transitions. Word has length 81 [2024-10-11 02:38:00,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:00,002 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 834 transitions. [2024-10-11 02:38:00,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:38:00,002 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 834 transitions. [2024-10-11 02:38:00,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 02:38:00,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:00,004 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 02:38:00,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:38:00,004 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:00,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:00,004 INFO L85 PathProgramCache]: Analyzing trace with hash 155887194, now seen corresponding path program 1 times [2024-10-11 02:38:00,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:00,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786632028] [2024-10-11 02:38:00,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:00,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:00,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:00,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:00,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:00,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:00,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:00,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:38:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:00,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:38:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:00,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:38:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:00,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:38:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:00,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:38:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:00,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:00,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786632028] [2024-10-11 02:38:00,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786632028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:00,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:00,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:00,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800200070] [2024-10-11 02:38:00,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:00,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:00,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:00,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:00,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:00,556 INFO L87 Difference]: Start difference. First operand 505 states and 834 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:38:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:06,120 INFO L93 Difference]: Finished difference Result 1317 states and 2258 transitions. [2024-10-11 02:38:06,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:06,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 81 [2024-10-11 02:38:06,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:06,125 INFO L225 Difference]: With dead ends: 1317 [2024-10-11 02:38:06,126 INFO L226 Difference]: Without dead ends: 822 [2024-10-11 02:38:06,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:38:06,129 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 946 mSDsluCounter, 2314 mSDsCounter, 0 mSdLazyCounter, 4874 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 2736 SdHoareTripleChecker+Invalid, 5149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 4874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:06,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 2736 Invalid, 5149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 4874 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 02:38:06,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-10-11 02:38:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 505. [2024-10-11 02:38:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 382 states have (on average 1.6649214659685865) internal successors, (636), 398 states have internal predecessors, (636), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-11 02:38:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 833 transitions. [2024-10-11 02:38:06,251 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 833 transitions. Word has length 81 [2024-10-11 02:38:06,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:06,251 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 833 transitions. [2024-10-11 02:38:06,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:38:06,251 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 833 transitions. [2024-10-11 02:38:06,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 02:38:06,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:06,253 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 02:38:06,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:38:06,254 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:06,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:06,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1257182221, now seen corresponding path program 1 times [2024-10-11 02:38:06,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:06,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579381670] [2024-10-11 02:38:06,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:06,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:06,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:06,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:06,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:06,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:06,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:06,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:38:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:06,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:38:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:06,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:38:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:06,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:38:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:06,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:38:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:06,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:06,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579381670] [2024-10-11 02:38:06,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579381670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:06,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:06,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:38:06,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406929990] [2024-10-11 02:38:06,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:06,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:38:06,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:06,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:38:06,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:38:06,791 INFO L87 Difference]: Start difference. First operand 505 states and 833 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:38:11,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:11,276 INFO L93 Difference]: Finished difference Result 1323 states and 2262 transitions. [2024-10-11 02:38:11,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:38:11,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2024-10-11 02:38:11,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:11,284 INFO L225 Difference]: With dead ends: 1323 [2024-10-11 02:38:11,284 INFO L226 Difference]: Without dead ends: 828 [2024-10-11 02:38:11,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:11,287 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 936 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 2726 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 2994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 2726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:11,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 1512 Invalid, 2994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 2726 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 02:38:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-10-11 02:38:11,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 511. [2024-10-11 02:38:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 388 states have (on average 1.6546391752577319) internal successors, (642), 404 states have internal predecessors, (642), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-11 02:38:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 839 transitions. [2024-10-11 02:38:11,433 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 839 transitions. Word has length 82 [2024-10-11 02:38:11,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:11,434 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 839 transitions. [2024-10-11 02:38:11,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 02:38:11,434 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 839 transitions. [2024-10-11 02:38:11,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 02:38:11,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:11,436 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 02:38:11,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:38:11,437 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:11,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:11,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1701082895, now seen corresponding path program 1 times [2024-10-11 02:38:11,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:11,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959766803] [2024-10-11 02:38:11,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:11,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:11,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:11,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:11,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:11,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:11,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:11,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:38:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:11,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:38:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:11,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:38:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:11,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:38:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:11,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:38:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:11,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:11,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959766803] [2024-10-11 02:38:11,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959766803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:11,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:11,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:11,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532284268] [2024-10-11 02:38:11,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:11,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:11,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:11,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:11,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:11,983 INFO L87 Difference]: Start difference. First operand 511 states and 839 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:38:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:17,810 INFO L93 Difference]: Finished difference Result 1331 states and 2268 transitions. [2024-10-11 02:38:17,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:17,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 82 [2024-10-11 02:38:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:17,815 INFO L225 Difference]: With dead ends: 1331 [2024-10-11 02:38:17,815 INFO L226 Difference]: Without dead ends: 822 [2024-10-11 02:38:17,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:38:17,817 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 940 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 4918 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 2822 SdHoareTripleChecker+Invalid, 5190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 4918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:17,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 2822 Invalid, 5190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 4918 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 02:38:17,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-10-11 02:38:17,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 505. [2024-10-11 02:38:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 382 states have (on average 1.662303664921466) internal successors, (635), 398 states have internal predecessors, (635), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-11 02:38:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 832 transitions. [2024-10-11 02:38:17,971 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 832 transitions. Word has length 82 [2024-10-11 02:38:17,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:17,972 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 832 transitions. [2024-10-11 02:38:17,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:38:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 832 transitions. [2024-10-11 02:38:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 02:38:17,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:17,974 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 02:38:17,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:38:17,974 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:17,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:17,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1931662592, now seen corresponding path program 1 times [2024-10-11 02:38:17,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:17,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405283821] [2024-10-11 02:38:17,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:17,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:38:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:38:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:38:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:38:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:38:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 02:38:18,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:18,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405283821] [2024-10-11 02:38:18,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405283821] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:38:18,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444760670] [2024-10-11 02:38:18,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:18,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:38:18,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:38:18,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:38:18,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:38:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:18,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 1532 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:38:18,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:38:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:38:18,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:38:18,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444760670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:18,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:38:18,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:38:18,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047440795] [2024-10-11 02:38:18,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:18,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:38:18,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:18,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:38:18,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:18,820 INFO L87 Difference]: Start difference. First operand 505 states and 832 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:38:19,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:19,087 INFO L93 Difference]: Finished difference Result 1440 states and 2399 transitions. [2024-10-11 02:38:19,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:38:19,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 83 [2024-10-11 02:38:19,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:19,093 INFO L225 Difference]: With dead ends: 1440 [2024-10-11 02:38:19,093 INFO L226 Difference]: Without dead ends: 947 [2024-10-11 02:38:19,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:19,095 INFO L432 NwaCegarLoop]: 827 mSDtfsCounter, 777 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:19,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1553 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:38:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-10-11 02:38:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 933. [2024-10-11 02:38:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 714 states have (on average 1.6722689075630253) internal successors, (1194), 745 states have internal predecessors, (1194), 176 states have call successors, (176), 43 states have call predecessors, (176), 42 states have return successors, (178), 170 states have call predecessors, (178), 173 states have call successors, (178) [2024-10-11 02:38:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1548 transitions. [2024-10-11 02:38:19,321 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1548 transitions. Word has length 83 [2024-10-11 02:38:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:19,321 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1548 transitions. [2024-10-11 02:38:19,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:38:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1548 transitions. [2024-10-11 02:38:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 02:38:19,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:19,325 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 02:38:19,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:38:19,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 02:38:19,526 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:19,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:19,527 INFO L85 PathProgramCache]: Analyzing trace with hash 496461151, now seen corresponding path program 1 times [2024-10-11 02:38:19,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:19,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434996467] [2024-10-11 02:38:19,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:19,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:19,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:38:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:38:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:38:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:38:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:38:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 02:38:20,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:20,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434996467] [2024-10-11 02:38:20,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434996467] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:38:20,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057236843] [2024-10-11 02:38:20,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:20,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:38:20,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:38:20,089 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:38:20,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:38:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:20,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 1533 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:38:20,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:38:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:38:20,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:38:20,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057236843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:20,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:38:20,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:38:20,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124277315] [2024-10-11 02:38:20,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:20,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:38:20,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:20,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:38:20,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:20,414 INFO L87 Difference]: Start difference. First operand 933 states and 1548 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:38:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:20,757 INFO L93 Difference]: Finished difference Result 2296 states and 3833 transitions. [2024-10-11 02:38:20,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:38:20,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 84 [2024-10-11 02:38:20,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:20,765 INFO L225 Difference]: With dead ends: 2296 [2024-10-11 02:38:20,765 INFO L226 Difference]: Without dead ends: 1375 [2024-10-11 02:38:20,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:20,770 INFO L432 NwaCegarLoop]: 873 mSDtfsCounter, 777 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:20,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1598 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:38:20,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-10-11 02:38:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1329. [2024-10-11 02:38:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1020 states have (on average 1.684313725490196) internal successors, (1718), 1066 states have internal predecessors, (1718), 249 states have call successors, (249), 59 states have call predecessors, (249), 59 states have return successors, (256), 242 states have call predecessors, (256), 246 states have call successors, (256) [2024-10-11 02:38:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 2223 transitions. [2024-10-11 02:38:21,099 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 2223 transitions. Word has length 84 [2024-10-11 02:38:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:21,099 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 2223 transitions. [2024-10-11 02:38:21,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 02:38:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 2223 transitions. [2024-10-11 02:38:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 02:38:21,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:21,104 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 02:38:21,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:38:21,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:38:21,305 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:21,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:21,305 INFO L85 PathProgramCache]: Analyzing trace with hash 92617374, now seen corresponding path program 1 times [2024-10-11 02:38:21,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:21,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061384506] [2024-10-11 02:38:21,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:21,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:38:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:38:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:38:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:38:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:38:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:38:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:21,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061384506] [2024-10-11 02:38:21,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061384506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:21,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:21,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:38:21,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363476096] [2024-10-11 02:38:21,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:21,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:38:21,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:21,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:38:21,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:38:21,812 INFO L87 Difference]: Start difference. First operand 1329 states and 2223 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)