./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4eb5ae4a2b95fd78cf87e688565203c0839d6de752e442a1cce7638954224909 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:46:27,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:46:27,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:46:27,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:46:27,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:46:27,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:46:27,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:46:27,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:46:27,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:46:27,716 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:46:27,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:46:27,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:46:27,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:46:27,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:46:27,717 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:46:27,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:46:27,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:46:27,717 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:46:27,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:46:27,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:46:27,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:46:27,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:46:27,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:46:27,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:46:27,717 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:46:27,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:46:27,717 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:46:27,717 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:46:27,717 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:46:27,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:46:27,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:46:27,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:46:27,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:46:27,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:46:27,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:46:27,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:46:27,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:46:27,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:46:27,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:46:27,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:46:27,718 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:46:27,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:46:27,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:46:27,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:46:27,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:46:27,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:46:27,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:46:27,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:46:27,718 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4eb5ae4a2b95fd78cf87e688565203c0839d6de752e442a1cce7638954224909 [2025-01-09 03:46:27,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:46:27,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:46:27,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:46:27,972 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:46:27,972 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:46:27,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c [2025-01-09 03:46:29,225 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/183ac56bf/d52009600ad444259837d06999c88bb5/FLAG7813e5c61 [2025-01-09 03:46:29,582 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:46:29,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c [2025-01-09 03:46:29,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/183ac56bf/d52009600ad444259837d06999c88bb5/FLAG7813e5c61 [2025-01-09 03:46:29,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/183ac56bf/d52009600ad444259837d06999c88bb5 [2025-01-09 03:46:29,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:46:29,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:46:29,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:46:29,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:46:29,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:46:29,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:46:29" (1/1) ... [2025-01-09 03:46:29,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f32dad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:29, skipping insertion in model container [2025-01-09 03:46:29,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:46:29" (1/1) ... [2025-01-09 03:46:29,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:46:30,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c[55726,55739] [2025-01-09 03:46:30,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:46:30,304 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:46:30,310 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-01-09 03:46:30,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [408] [2025-01-09 03:46:30,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [423] [2025-01-09 03:46:30,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [789] [2025-01-09 03:46:30,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2329] [2025-01-09 03:46:30,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2447] [2025-01-09 03:46:30,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [2482] [2025-01-09 03:46:30,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2669] [2025-01-09 03:46:30,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2678] [2025-01-09 03:46:30,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2769] [2025-01-09 03:46:30,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c[55726,55739] [2025-01-09 03:46:30,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:46:30,441 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:46:30,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:30 WrapperNode [2025-01-09 03:46:30,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:46:30,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:46:30,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:46:30,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:46:30,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:30" (1/1) ... [2025-01-09 03:46:30,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:30" (1/1) ... [2025-01-09 03:46:30,502 INFO L138 Inliner]: procedures = 92, calls = 346, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 1087 [2025-01-09 03:46:30,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:46:30,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:46:30,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:46:30,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:46:30,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:30" (1/1) ... [2025-01-09 03:46:30,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:30" (1/1) ... [2025-01-09 03:46:30,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:30" (1/1) ... [2025-01-09 03:46:30,552 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-01-09 03:46:30,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:30" (1/1) ... [2025-01-09 03:46:30,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:30" (1/1) ... [2025-01-09 03:46:30,570 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:30" (1/1) ... [2025-01-09 03:46:30,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:30" (1/1) ... [2025-01-09 03:46:30,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:30" (1/1) ... [2025-01-09 03:46:30,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:30" (1/1) ... [2025-01-09 03:46:30,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:30" (1/1) ... [2025-01-09 03:46:30,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:46:30,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:46:30,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:46:30,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:46:30,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:30" (1/1) ... [2025-01-09 03:46:30,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:46:30,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:46:30,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:46:30,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:46:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:46:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-01-09 03:46:30,658 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-01-09 03:46:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:46:30,659 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:46:30,659 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2025-01-09 03:46:30,659 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2025-01-09 03:46:30,659 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:46:30,659 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:46:30,659 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-01-09 03:46:30,659 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-01-09 03:46:30,660 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:46:30,660 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:46:30,660 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-01-09 03:46:30,660 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-01-09 03:46:30,660 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:46:30,660 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:46:30,660 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:46:30,660 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:46:30,660 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:46:30,661 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:46:30,661 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:46:30,661 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:46:30,661 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:46:30,661 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:46:30,661 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:46:30,661 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:46:30,661 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:46:30,661 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:46:30,661 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-01-09 03:46:30,661 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-01-09 03:46:30,661 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-01-09 03:46:30,661 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-01-09 03:46:30,662 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:46:30,662 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:46:30,662 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-01-09 03:46:30,662 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-01-09 03:46:30,662 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:46:30,662 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:46:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:46:30,663 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:46:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:46:30,663 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:46:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:46:30,663 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:46:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:46:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:46:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:46:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:46:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:46:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:46:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:46:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:46:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:46:30,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:46:30,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:46:30,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:46:30,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:46:30,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:46:30,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:46:30,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:46:30,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:46:30,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:46:30,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:46:30,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:46:30,665 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-01-09 03:46:30,665 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-01-09 03:46:30,665 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:46:30,665 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:46:30,666 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:46:30,666 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:46:30,666 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:46:30,666 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:46:30,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:46:30,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:46:30,666 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:46:30,666 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:46:30,829 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:46:30,832 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:46:31,846 INFO L? ?]: Removed 457 outVars from TransFormulas that were not future-live. [2025-01-09 03:46:31,847 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:46:31,863 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:46:31,863 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:46:31,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:46:31 BoogieIcfgContainer [2025-01-09 03:46:31,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:46:31,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:46:31,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:46:31,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:46:31,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:46:29" (1/3) ... [2025-01-09 03:46:31,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c373272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:46:31, skipping insertion in model container [2025-01-09 03:46:31,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:46:30" (2/3) ... [2025-01-09 03:46:31,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c373272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:46:31, skipping insertion in model container [2025-01-09 03:46:31,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:46:31" (3/3) ... [2025-01-09 03:46:31,870 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product19.cil.c [2025-01-09 03:46:31,880 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:46:31,882 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product19.cil.c that has 28 procedures, 588 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:46:31,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:46:31,965 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;@354f3833, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:46:31,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:46:31,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 588 states, 451 states have (on average 1.6674057649667406) internal successors, (752), 469 states have internal predecessors, (752), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 03:46:32,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:46:32,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:32,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:32,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:32,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:32,013 INFO L85 PathProgramCache]: Analyzing trace with hash 438946037, now seen corresponding path program 1 times [2025-01-09 03:46:32,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:32,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647641653] [2025-01-09 03:46:32,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:32,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:32,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:46:32,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:46:32,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:32,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:46:32,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:32,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647641653] [2025-01-09 03:46:32,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647641653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:32,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:32,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:46:32,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011921185] [2025-01-09 03:46:32,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:32,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:46:32,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:32,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:46:32,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:32,687 INFO L87 Difference]: Start difference. First operand has 588 states, 451 states have (on average 1.6674057649667406) internal successors, (752), 469 states have internal predecessors, (752), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) Second operand has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:32,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:32,912 INFO L93 Difference]: Finished difference Result 1173 states and 1948 transitions. [2025-01-09 03:46:32,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:46:32,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2025-01-09 03:46:32,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:32,932 INFO L225 Difference]: With dead ends: 1173 [2025-01-09 03:46:32,933 INFO L226 Difference]: Without dead ends: 593 [2025-01-09 03:46:32,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:46:32,953 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 91 mSDsluCounter, 4670 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5621 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:32,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5621 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:46:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-01-09 03:46:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2025-01-09 03:46:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 454 states have (on average 1.6607929515418502) internal successors, (754), 472 states have internal predecessors, (754), 109 states have call successors, (109), 27 states have call predecessors, (109), 27 states have return successors, (108), 104 states have call predecessors, (108), 106 states have call successors, (108) [2025-01-09 03:46:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 971 transitions. [2025-01-09 03:46:33,044 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 971 transitions. Word has length 113 [2025-01-09 03:46:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:33,044 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 971 transitions. [2025-01-09 03:46:33,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 971 transitions. [2025-01-09 03:46:33,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:46:33,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:33,049 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:33,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:46:33,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:33,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:33,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1911925092, now seen corresponding path program 1 times [2025-01-09 03:46:33,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:33,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968922999] [2025-01-09 03:46:33,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:33,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:33,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:46:33,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:46:33,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:33,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:46:33,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:33,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968922999] [2025-01-09 03:46:33,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968922999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:33,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:33,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:46:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825844842] [2025-01-09 03:46:33,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:33,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:46:33,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:33,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:46:33,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:33,417 INFO L87 Difference]: Start difference. First operand 591 states and 971 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:33,558 INFO L93 Difference]: Finished difference Result 1177 states and 1945 transitions. [2025-01-09 03:46:33,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:46:33,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2025-01-09 03:46:33,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:33,564 INFO L225 Difference]: With dead ends: 1177 [2025-01-09 03:46:33,565 INFO L226 Difference]: Without dead ends: 602 [2025-01-09 03:46:33,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:46:33,570 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 90 mSDsluCounter, 4664 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 5616 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:33,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 5616 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:33,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-01-09 03:46:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 591. [2025-01-09 03:46:33,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 454 states have (on average 1.6607929515418502) internal successors, (754), 472 states have internal predecessors, (754), 109 states have call successors, (109), 27 states have call predecessors, (109), 27 states have return successors, (108), 104 states have call predecessors, (108), 106 states have call successors, (108) [2025-01-09 03:46:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 971 transitions. [2025-01-09 03:46:33,617 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 971 transitions. Word has length 114 [2025-01-09 03:46:33,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:33,618 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 971 transitions. [2025-01-09 03:46:33,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 971 transitions. [2025-01-09 03:46:33,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:46:33,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:33,623 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:33,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:46:33,623 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:33,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:33,624 INFO L85 PathProgramCache]: Analyzing trace with hash 936790784, now seen corresponding path program 1 times [2025-01-09 03:46:33,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:33,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468047071] [2025-01-09 03:46:33,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:33,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:33,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:46:33,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:46:33,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:33,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:46:33,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:33,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468047071] [2025-01-09 03:46:33,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468047071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:33,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:33,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:33,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019898847] [2025-01-09 03:46:33,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:33,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:33,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:33,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:33,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:33,875 INFO L87 Difference]: Start difference. First operand 591 states and 971 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:46:33,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:33,929 INFO L93 Difference]: Finished difference Result 1164 states and 1923 transitions. [2025-01-09 03:46:33,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:46:33,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-01-09 03:46:33,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:33,933 INFO L225 Difference]: With dead ends: 1164 [2025-01-09 03:46:33,935 INFO L226 Difference]: Without dead ends: 561 [2025-01-09 03:46:33,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:46:33,937 INFO L435 NwaCegarLoop]: 941 mSDtfsCounter, 14 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:33,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2818 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-01-09 03:46:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-01-09 03:46:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 427 states have (on average 1.6440281030444965) internal successors, (702), 443 states have internal predecessors, (702), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 03:46:33,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 915 transitions. [2025-01-09 03:46:33,962 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 915 transitions. Word has length 114 [2025-01-09 03:46:33,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:33,962 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 915 transitions. [2025-01-09 03:46:33,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:46:33,962 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 915 transitions. [2025-01-09 03:46:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:46:33,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:33,965 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:33,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:46:33,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:33,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:33,967 INFO L85 PathProgramCache]: Analyzing trace with hash 557443833, now seen corresponding path program 1 times [2025-01-09 03:46:33,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:33,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624763941] [2025-01-09 03:46:33,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:33,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:33,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:46:34,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:46:34,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:34,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:46:34,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:34,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624763941] [2025-01-09 03:46:34,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624763941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:34,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:34,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:46:34,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617457614] [2025-01-09 03:46:34,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:34,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:46:34,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:34,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:46:34,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:34,162 INFO L87 Difference]: Start difference. First operand 561 states and 915 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:34,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:34,223 INFO L93 Difference]: Finished difference Result 1115 states and 1829 transitions. [2025-01-09 03:46:34,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:46:34,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-01-09 03:46:34,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:34,226 INFO L225 Difference]: With dead ends: 1115 [2025-01-09 03:46:34,227 INFO L226 Difference]: Without dead ends: 555 [2025-01-09 03:46:34,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:46:34,230 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 63 mSDsluCounter, 4467 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5372 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:34,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5372 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:34,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-01-09 03:46:34,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-01-09 03:46:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 421 states have (on average 1.6365795724465557) internal successors, (689), 437 states have internal predecessors, (689), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 03:46:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 902 transitions. [2025-01-09 03:46:34,249 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 902 transitions. Word has length 115 [2025-01-09 03:46:34,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:34,249 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 902 transitions. [2025-01-09 03:46:34,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 902 transitions. [2025-01-09 03:46:34,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:46:34,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:34,251 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:34,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:46:34,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:34,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:34,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2130399072, now seen corresponding path program 1 times [2025-01-09 03:46:34,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:34,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708261649] [2025-01-09 03:46:34,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:34,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:34,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:46:34,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:46:34,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:34,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:34,435 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:46:34,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:34,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708261649] [2025-01-09 03:46:34,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708261649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:34,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:34,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:46:34,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114247888] [2025-01-09 03:46:34,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:34,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:46:34,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:34,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:46:34,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:34,437 INFO L87 Difference]: Start difference. First operand 555 states and 902 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:34,495 INFO L93 Difference]: Finished difference Result 1103 states and 1803 transitions. [2025-01-09 03:46:34,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:46:34,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-01-09 03:46:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:34,499 INFO L225 Difference]: With dead ends: 1103 [2025-01-09 03:46:34,499 INFO L226 Difference]: Without dead ends: 549 [2025-01-09 03:46:34,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:46:34,502 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 49 mSDsluCounter, 4419 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5312 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:34,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5312 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:34,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-01-09 03:46:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-01-09 03:46:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 415 states have (on average 1.6289156626506025) internal successors, (676), 431 states have internal predecessors, (676), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 03:46:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 889 transitions. [2025-01-09 03:46:34,520 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 889 transitions. Word has length 116 [2025-01-09 03:46:34,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:34,520 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 889 transitions. [2025-01-09 03:46:34,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 889 transitions. [2025-01-09 03:46:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:46:34,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:34,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:34,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:46:34,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:34,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:34,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1416907551, now seen corresponding path program 1 times [2025-01-09 03:46:34,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:34,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354796630] [2025-01-09 03:46:34,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:34,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:34,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:46:34,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:46:34,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:34,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:34,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:46:34,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:34,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354796630] [2025-01-09 03:46:34,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354796630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:34,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:34,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:46:34,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813041916] [2025-01-09 03:46:34,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:34,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:46:34,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:34,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:46:34,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:34,666 INFO L87 Difference]: Start difference. First operand 549 states and 889 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:34,718 INFO L93 Difference]: Finished difference Result 1091 states and 1777 transitions. [2025-01-09 03:46:34,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:46:34,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-01-09 03:46:34,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:34,722 INFO L225 Difference]: With dead ends: 1091 [2025-01-09 03:46:34,722 INFO L226 Difference]: Without dead ends: 549 [2025-01-09 03:46:34,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:46:34,725 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 24 mSDsluCounter, 4383 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5264 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:34,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5264 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:34,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-01-09 03:46:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-01-09 03:46:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 415 states have (on average 1.6265060240963856) internal successors, (675), 431 states have internal predecessors, (675), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 03:46:34,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 888 transitions. [2025-01-09 03:46:34,743 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 888 transitions. Word has length 116 [2025-01-09 03:46:34,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:34,743 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 888 transitions. [2025-01-09 03:46:34,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 888 transitions. [2025-01-09 03:46:34,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:46:34,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:34,746 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:34,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:46:34,746 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:34,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:34,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1684333821, now seen corresponding path program 1 times [2025-01-09 03:46:34,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:34,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204164242] [2025-01-09 03:46:34,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:34,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:34,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:46:34,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:46:34,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:34,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:46:34,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:34,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204164242] [2025-01-09 03:46:34,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204164242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:34,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:34,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:34,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473105780] [2025-01-09 03:46:34,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:34,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:34,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:34,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:34,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:34,865 INFO L87 Difference]: Start difference. First operand 549 states and 888 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:46:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:34,905 INFO L93 Difference]: Finished difference Result 1082 states and 1762 transitions. [2025-01-09 03:46:34,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:46:34,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2025-01-09 03:46:34,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:34,909 INFO L225 Difference]: With dead ends: 1082 [2025-01-09 03:46:34,909 INFO L226 Difference]: Without dead ends: 549 [2025-01-09 03:46:34,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:34,912 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 15 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2604 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:34,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2604 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-01-09 03:46:34,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-01-09 03:46:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 415 states have (on average 1.6240963855421686) internal successors, (674), 431 states have internal predecessors, (674), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 03:46:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 887 transitions. [2025-01-09 03:46:34,929 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 887 transitions. Word has length 117 [2025-01-09 03:46:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:34,929 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 887 transitions. [2025-01-09 03:46:34,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:46:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 887 transitions. [2025-01-09 03:46:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:46:34,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:34,931 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:34,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:46:34,932 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:34,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:34,932 INFO L85 PathProgramCache]: Analyzing trace with hash 957760480, now seen corresponding path program 1 times [2025-01-09 03:46:34,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:34,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702110264] [2025-01-09 03:46:34,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:34,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:34,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:46:34,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:46:34,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:34,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:46:35,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:35,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702110264] [2025-01-09 03:46:35,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702110264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:35,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:35,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:35,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417541967] [2025-01-09 03:46:35,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:35,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:35,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:35,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:35,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:35,026 INFO L87 Difference]: Start difference. First operand 549 states and 887 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:46:35,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:35,064 INFO L93 Difference]: Finished difference Result 1082 states and 1760 transitions. [2025-01-09 03:46:35,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:46:35,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2025-01-09 03:46:35,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:35,068 INFO L225 Difference]: With dead ends: 1082 [2025-01-09 03:46:35,068 INFO L226 Difference]: Without dead ends: 549 [2025-01-09 03:46:35,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:35,070 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 14 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2606 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:35,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2606 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-01-09 03:46:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-01-09 03:46:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 415 states have (on average 1.621686746987952) internal successors, (673), 431 states have internal predecessors, (673), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 03:46:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 886 transitions. [2025-01-09 03:46:35,086 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 886 transitions. Word has length 118 [2025-01-09 03:46:35,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:35,086 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 886 transitions. [2025-01-09 03:46:35,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:46:35,087 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 886 transitions. [2025-01-09 03:46:35,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:46:35,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:35,089 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:35,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:46:35,089 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:35,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:35,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1842420510, now seen corresponding path program 1 times [2025-01-09 03:46:35,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:35,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418571087] [2025-01-09 03:46:35,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:35,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:35,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:46:35,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:46:35,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:35,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:46:35,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:35,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418571087] [2025-01-09 03:46:35,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418571087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:35,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:35,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:35,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742029257] [2025-01-09 03:46:35,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:35,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:35,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:35,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:35,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:35,214 INFO L87 Difference]: Start difference. First operand 549 states and 886 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:46:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:35,253 INFO L93 Difference]: Finished difference Result 1082 states and 1758 transitions. [2025-01-09 03:46:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:46:35,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-01-09 03:46:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:35,257 INFO L225 Difference]: With dead ends: 1082 [2025-01-09 03:46:35,257 INFO L226 Difference]: Without dead ends: 549 [2025-01-09 03:46:35,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:35,261 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 13 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2608 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:35,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2608 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:35,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-01-09 03:46:35,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-01-09 03:46:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 415 states have (on average 1.619277108433735) internal successors, (672), 431 states have internal predecessors, (672), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 03:46:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 885 transitions. [2025-01-09 03:46:35,280 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 885 transitions. Word has length 119 [2025-01-09 03:46:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:35,281 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 885 transitions. [2025-01-09 03:46:35,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:46:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 885 transitions. [2025-01-09 03:46:35,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:46:35,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:35,283 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:35,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:46:35,284 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:35,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:35,284 INFO L85 PathProgramCache]: Analyzing trace with hash -204961883, now seen corresponding path program 1 times [2025-01-09 03:46:35,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:35,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576777783] [2025-01-09 03:46:35,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:35,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:35,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:46:35,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:46:35,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:35,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:46:35,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:35,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576777783] [2025-01-09 03:46:35,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576777783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:35,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:35,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:35,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972175098] [2025-01-09 03:46:35,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:35,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:35,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:35,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:35,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:35,397 INFO L87 Difference]: Start difference. First operand 549 states and 885 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:46:35,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:35,437 INFO L93 Difference]: Finished difference Result 1082 states and 1756 transitions. [2025-01-09 03:46:35,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:46:35,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2025-01-09 03:46:35,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:35,441 INFO L225 Difference]: With dead ends: 1082 [2025-01-09 03:46:35,441 INFO L226 Difference]: Without dead ends: 549 [2025-01-09 03:46:35,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:35,444 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 12 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:35,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2610 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-01-09 03:46:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-01-09 03:46:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 415 states have (on average 1.616867469879518) internal successors, (671), 431 states have internal predecessors, (671), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 03:46:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 884 transitions. [2025-01-09 03:46:35,463 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 884 transitions. Word has length 120 [2025-01-09 03:46:35,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:35,464 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 884 transitions. [2025-01-09 03:46:35,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:46:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 884 transitions. [2025-01-09 03:46:35,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:46:35,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:35,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:35,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:46:35,467 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:35,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:35,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1560371399, now seen corresponding path program 1 times [2025-01-09 03:46:35,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:35,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139481362] [2025-01-09 03:46:35,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:35,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:35,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:46:35,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:46:35,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:35,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 03:46:35,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:35,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139481362] [2025-01-09 03:46:35,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139481362] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:46:35,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084578162] [2025-01-09 03:46:35,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:35,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:46:35,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:46:35,638 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:46:35,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:46:35,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:46:35,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:46:35,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:35,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:35,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:46:35,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:46:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:46:36,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:46:36,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084578162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:36,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:46:36,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:46:36,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739081829] [2025-01-09 03:46:36,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:36,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:46:36,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:36,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:46:36,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:36,054 INFO L87 Difference]: Start difference. First operand 549 states and 884 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:36,141 INFO L93 Difference]: Finished difference Result 1558 states and 2540 transitions. [2025-01-09 03:46:36,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:46:36,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2025-01-09 03:46:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:36,149 INFO L225 Difference]: With dead ends: 1558 [2025-01-09 03:46:36,149 INFO L226 Difference]: Without dead ends: 1027 [2025-01-09 03:46:36,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:36,153 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 809 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:36,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 2287 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2025-01-09 03:46:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1012. [2025-01-09 03:46:36,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 772 states have (on average 1.6295336787564767) internal successors, (1258), 803 states have internal predecessors, (1258), 191 states have call successors, (191), 49 states have call predecessors, (191), 48 states have return successors, (193), 185 states have call predecessors, (193), 188 states have call successors, (193) [2025-01-09 03:46:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1642 transitions. [2025-01-09 03:46:36,194 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1642 transitions. Word has length 121 [2025-01-09 03:46:36,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:36,196 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1642 transitions. [2025-01-09 03:46:36,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:36,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1642 transitions. [2025-01-09 03:46:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:46:36,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:36,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:36,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:46:36,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 03:46:36,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:36,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:36,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1238377991, now seen corresponding path program 1 times [2025-01-09 03:46:36,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:36,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949097886] [2025-01-09 03:46:36,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:36,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:46:36,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:46:36,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:36,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:36,550 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 03:46:36,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:36,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949097886] [2025-01-09 03:46:36,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949097886] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:46:36,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764242963] [2025-01-09 03:46:36,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:36,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:46:36,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:46:36,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:46:36,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:46:36,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:46:36,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:46:36,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:36,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:36,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 1640 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:46:36,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:46:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:46:36,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:46:36,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764242963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:36,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:46:36,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:46:36,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287569621] [2025-01-09 03:46:36,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:36,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:46:36,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:36,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:46:36,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:36,929 INFO L87 Difference]: Start difference. First operand 1012 states and 1642 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:36,999 INFO L93 Difference]: Finished difference Result 2484 states and 4058 transitions. [2025-01-09 03:46:36,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:46:36,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2025-01-09 03:46:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:37,008 INFO L225 Difference]: With dead ends: 2484 [2025-01-09 03:46:37,008 INFO L226 Difference]: Without dead ends: 1490 [2025-01-09 03:46:37,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:37,013 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 809 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:37,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 2345 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2025-01-09 03:46:37,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1442. [2025-01-09 03:46:37,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1102 states have (on average 1.6415607985480944) internal successors, (1809), 1148 states have internal predecessors, (1809), 271 states have call successors, (271), 68 states have call predecessors, (271), 68 states have return successors, (278), 264 states have call predecessors, (278), 268 states have call successors, (278) [2025-01-09 03:46:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2358 transitions. [2025-01-09 03:46:37,067 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2358 transitions. Word has length 122 [2025-01-09 03:46:37,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:37,068 INFO L471 AbstractCegarLoop]: Abstraction has 1442 states and 2358 transitions. [2025-01-09 03:46:37,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2358 transitions. [2025-01-09 03:46:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 03:46:37,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:37,072 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:37,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:46:37,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:46:37,277 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:37,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:37,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1201664301, now seen corresponding path program 1 times [2025-01-09 03:46:37,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:37,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599162117] [2025-01-09 03:46:37,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:37,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:37,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:46:37,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:46:37,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:37,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:46:37,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:37,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599162117] [2025-01-09 03:46:37,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599162117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:37,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:37,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:46:37,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988015279] [2025-01-09 03:46:37,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:37,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:46:37,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:37,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:46:37,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:46:37,460 INFO L87 Difference]: Start difference. First operand 1442 states and 2358 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:46:37,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:37,989 INFO L93 Difference]: Finished difference Result 4262 states and 7075 transitions. [2025-01-09 03:46:37,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:46:37,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2025-01-09 03:46:37,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:38,006 INFO L225 Difference]: With dead ends: 4262 [2025-01-09 03:46:38,007 INFO L226 Difference]: Without dead ends: 2838 [2025-01-09 03:46:38,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:46:38,016 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 873 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:38,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 4543 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:46:38,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2025-01-09 03:46:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2791. [2025-01-09 03:46:38,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2791 states, 2137 states have (on average 1.6448291998128217) internal successors, (3515), 2225 states have internal predecessors, (3515), 521 states have call successors, (521), 130 states have call predecessors, (521), 132 states have return successors, (597), 513 states have call predecessors, (597), 517 states have call successors, (597) [2025-01-09 03:46:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 4633 transitions. [2025-01-09 03:46:38,144 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 4633 transitions. Word has length 124 [2025-01-09 03:46:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:38,144 INFO L471 AbstractCegarLoop]: Abstraction has 2791 states and 4633 transitions. [2025-01-09 03:46:38,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:46:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 4633 transitions. [2025-01-09 03:46:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:46:38,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:38,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:38,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:46:38,150 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:38,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:38,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1432827135, now seen corresponding path program 1 times [2025-01-09 03:46:38,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:38,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486993715] [2025-01-09 03:46:38,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:38,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:38,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:46:38,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:46:38,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:38,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:38,368 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 03:46:38,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:38,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486993715] [2025-01-09 03:46:38,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486993715] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:46:38,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682440370] [2025-01-09 03:46:38,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:38,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:46:38,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:46:38,373 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:46:38,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:46:38,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:46:38,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:46:38,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:38,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:38,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:46:38,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:46:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:46:38,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:46:38,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682440370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:38,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:46:38,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:46:38,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29282689] [2025-01-09 03:46:38,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:38,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:46:38,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:38,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:46:38,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:38,697 INFO L87 Difference]: Start difference. First operand 2791 states and 4633 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:46:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:38,919 INFO L93 Difference]: Finished difference Result 8305 states and 13991 transitions. [2025-01-09 03:46:38,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:46:38,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 125 [2025-01-09 03:46:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:38,959 INFO L225 Difference]: With dead ends: 8305 [2025-01-09 03:46:38,960 INFO L226 Difference]: Without dead ends: 5533 [2025-01-09 03:46:38,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:38,979 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 869 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:38,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1742 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:38,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5533 states. [2025-01-09 03:46:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5533 to 5466. [2025-01-09 03:46:39,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5466 states, 4198 states have (on average 1.6491186279180563) internal successors, (6923), 4366 states have internal predecessors, (6923), 1008 states have call successors, (1008), 248 states have call predecessors, (1008), 259 states have return successors, (1239), 1007 states have call predecessors, (1239), 1002 states have call successors, (1239) [2025-01-09 03:46:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 9170 transitions. [2025-01-09 03:46:39,306 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 9170 transitions. Word has length 125 [2025-01-09 03:46:39,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:39,306 INFO L471 AbstractCegarLoop]: Abstraction has 5466 states and 9170 transitions. [2025-01-09 03:46:39,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:46:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 9170 transitions. [2025-01-09 03:46:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:46:39,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:39,312 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:39,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:46:39,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:46:39,513 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:39,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:39,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1851022911, now seen corresponding path program 1 times [2025-01-09 03:46:39,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:39,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286500335] [2025-01-09 03:46:39,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:39,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:39,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:46:39,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:46:39,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:39,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 03:46:39,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:39,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286500335] [2025-01-09 03:46:39,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286500335] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:46:39,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994717629] [2025-01-09 03:46:39,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:39,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:46:39,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:46:39,695 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:46:39,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:46:39,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:46:39,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:46:39,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:39,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:40,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 1657 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 03:46:40,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:46:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:46:40,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:46:40,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994717629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:40,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:46:40,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:46:40,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464616380] [2025-01-09 03:46:40,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:40,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:46:40,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:40,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:46:40,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:40,141 INFO L87 Difference]: Start difference. First operand 5466 states and 9170 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:46:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:40,673 INFO L93 Difference]: Finished difference Result 15842 states and 26955 transitions. [2025-01-09 03:46:40,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:46:40,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2025-01-09 03:46:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:40,745 INFO L225 Difference]: With dead ends: 15842 [2025-01-09 03:46:40,746 INFO L226 Difference]: Without dead ends: 10395 [2025-01-09 03:46:40,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:46:40,793 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 719 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:40,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1719 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:46:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10395 states. [2025-01-09 03:46:41,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10395 to 10352. [2025-01-09 03:46:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10352 states, 7924 states have (on average 1.6157243816254416) internal successors, (12803), 8252 states have internal predecessors, (12803), 1920 states have call successors, (1920), 490 states have call predecessors, (1920), 507 states have return successors, (2472), 1915 states have call predecessors, (2472), 1910 states have call successors, (2472) [2025-01-09 03:46:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10352 states to 10352 states and 17195 transitions. [2025-01-09 03:46:41,317 INFO L78 Accepts]: Start accepts. Automaton has 10352 states and 17195 transitions. Word has length 125 [2025-01-09 03:46:41,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:41,318 INFO L471 AbstractCegarLoop]: Abstraction has 10352 states and 17195 transitions. [2025-01-09 03:46:41,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:46:41,319 INFO L276 IsEmpty]: Start isEmpty. Operand 10352 states and 17195 transitions. [2025-01-09 03:46:41,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:46:41,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:41,323 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:41,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:46:41,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 03:46:41,527 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:41,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:41,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1347099039, now seen corresponding path program 1 times [2025-01-09 03:46:41,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:41,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053000222] [2025-01-09 03:46:41,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:41,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:41,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:46:41,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:46:41,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:41,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:46:41,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:41,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053000222] [2025-01-09 03:46:41,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053000222] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:46:41,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42573032] [2025-01-09 03:46:41,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:41,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:46:41,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:46:41,729 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:46:41,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:46:41,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:46:41,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:46:41,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:41,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:42,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 03:46:42,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:46:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:46:42,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:46:42,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42573032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:42,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:46:42,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-01-09 03:46:42,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569125953] [2025-01-09 03:46:42,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:42,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:46:42,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:42,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:46:42,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:46:42,148 INFO L87 Difference]: Start difference. First operand 10352 states and 17195 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 states have internal predecessors, (83), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 03:46:43,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:43,170 INFO L93 Difference]: Finished difference Result 19561 states and 32568 transitions. [2025-01-09 03:46:43,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:46:43,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 states have internal predecessors, (83), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 127 [2025-01-09 03:46:43,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:43,256 INFO L225 Difference]: With dead ends: 19561 [2025-01-09 03:46:43,257 INFO L226 Difference]: Without dead ends: 9227 [2025-01-09 03:46:43,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:46:43,311 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 739 mSDsluCounter, 3140 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 4069 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:43,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 4069 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 03:46:43,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9227 states. [2025-01-09 03:46:43,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9227 to 9205. [2025-01-09 03:46:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9205 states, 7065 states have (on average 1.602689313517339) internal successors, (11323), 7340 states have internal predecessors, (11323), 1678 states have call successors, (1678), 446 states have call predecessors, (1678), 461 states have return successors, (2138), 1674 states have call predecessors, (2138), 1668 states have call successors, (2138) [2025-01-09 03:46:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9205 states to 9205 states and 15139 transitions. [2025-01-09 03:46:43,717 INFO L78 Accepts]: Start accepts. Automaton has 9205 states and 15139 transitions. Word has length 127 [2025-01-09 03:46:43,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:43,718 INFO L471 AbstractCegarLoop]: Abstraction has 9205 states and 15139 transitions. [2025-01-09 03:46:43,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 states have internal predecessors, (83), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 03:46:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 9205 states and 15139 transitions. [2025-01-09 03:46:43,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:46:43,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:43,721 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:43,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:46:43,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 03:46:43,926 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:43,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:43,927 INFO L85 PathProgramCache]: Analyzing trace with hash 707773045, now seen corresponding path program 1 times [2025-01-09 03:46:43,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:43,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147482153] [2025-01-09 03:46:43,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:43,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:43,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:46:43,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:46:43,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:43,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:46:44,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:44,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147482153] [2025-01-09 03:46:44,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147482153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:44,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:44,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:44,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697293559] [2025-01-09 03:46:44,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:44,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:44,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:44,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:44,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:44,096 INFO L87 Difference]: Start difference. First operand 9205 states and 15139 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:46:44,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:44,597 INFO L93 Difference]: Finished difference Result 18440 states and 30673 transitions. [2025-01-09 03:46:44,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:46:44,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2025-01-09 03:46:44,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:44,658 INFO L225 Difference]: With dead ends: 18440 [2025-01-09 03:46:44,659 INFO L226 Difference]: Without dead ends: 9253 [2025-01-09 03:46:44,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:46:44,714 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 12 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:44,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2576 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:46:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9253 states. [2025-01-09 03:46:45,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9253 to 9221. [2025-01-09 03:46:45,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9221 states, 7077 states have (on average 1.6011021619330226) internal successors, (11331), 7352 states have internal predecessors, (11331), 1678 states have call successors, (1678), 454 states have call predecessors, (1678), 465 states have return successors, (2112), 1670 states have call predecessors, (2112), 1668 states have call successors, (2112) [2025-01-09 03:46:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9221 states to 9221 states and 15121 transitions. [2025-01-09 03:46:45,077 INFO L78 Accepts]: Start accepts. Automaton has 9221 states and 15121 transitions. Word has length 127 [2025-01-09 03:46:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:45,078 INFO L471 AbstractCegarLoop]: Abstraction has 9221 states and 15121 transitions. [2025-01-09 03:46:45,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:46:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 9221 states and 15121 transitions. [2025-01-09 03:46:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 03:46:45,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:45,082 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:45,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:46:45,082 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:45,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:45,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1702781837, now seen corresponding path program 1 times [2025-01-09 03:46:45,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:45,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396679804] [2025-01-09 03:46:45,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:45,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:45,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 03:46:45,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 03:46:45,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:45,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:46:45,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:45,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396679804] [2025-01-09 03:46:45,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396679804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:45,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:45,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:46:45,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793104316] [2025-01-09 03:46:45,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:45,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:46:45,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:45,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:46:45,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:46:45,213 INFO L87 Difference]: Start difference. First operand 9221 states and 15121 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:46:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:46,033 INFO L93 Difference]: Finished difference Result 27609 states and 46461 transitions. [2025-01-09 03:46:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:46:46,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2025-01-09 03:46:46,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:46,142 INFO L225 Difference]: With dead ends: 27609 [2025-01-09 03:46:46,142 INFO L226 Difference]: Without dead ends: 18406 [2025-01-09 03:46:46,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:46:46,197 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 867 mSDsluCounter, 3461 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 4414 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:46,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 4414 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:46:46,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18406 states. [2025-01-09 03:46:46,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18406 to 18305. [2025-01-09 03:46:46,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18305 states, 14060 states have (on average 1.5975817923186344) internal successors, (22462), 14601 states have internal predecessors, (22462), 3311 states have call successors, (3311), 902 states have call predecessors, (3311), 933 states have return successors, (4825), 3313 states have call predecessors, (4825), 3293 states have call successors, (4825) [2025-01-09 03:46:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18305 states to 18305 states and 30598 transitions. [2025-01-09 03:46:47,090 INFO L78 Accepts]: Start accepts. Automaton has 18305 states and 30598 transitions. Word has length 135 [2025-01-09 03:46:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:47,091 INFO L471 AbstractCegarLoop]: Abstraction has 18305 states and 30598 transitions. [2025-01-09 03:46:47,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:46:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 18305 states and 30598 transitions. [2025-01-09 03:46:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 03:46:47,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:47,097 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:47,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:46:47,098 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:47,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:47,098 INFO L85 PathProgramCache]: Analyzing trace with hash -116195457, now seen corresponding path program 1 times [2025-01-09 03:46:47,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:47,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947888617] [2025-01-09 03:46:47,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:47,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:47,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:46:47,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:46:47,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:47,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:47,212 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:46:47,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:47,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947888617] [2025-01-09 03:46:47,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947888617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:47,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:47,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:47,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440578959] [2025-01-09 03:46:47,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:47,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:47,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:47,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:47,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:47,216 INFO L87 Difference]: Start difference. First operand 18305 states and 30598 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:46:47,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:47,921 INFO L93 Difference]: Finished difference Result 36736 states and 62411 transitions. [2025-01-09 03:46:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:46:47,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-01-09 03:46:47,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:48,030 INFO L225 Difference]: With dead ends: 36736 [2025-01-09 03:46:48,030 INFO L226 Difference]: Without dead ends: 18449 [2025-01-09 03:46:48,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:46:48,128 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 12 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:48,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2570 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18449 states. [2025-01-09 03:46:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18449 to 18385. [2025-01-09 03:46:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18385 states, 14132 states have (on average 1.595103311633173) internal successors, (22542), 14657 states have internal predecessors, (22542), 3311 states have call successors, (3311), 934 states have call predecessors, (3311), 941 states have return successors, (4785), 3305 states have call predecessors, (4785), 3293 states have call successors, (4785) [2025-01-09 03:46:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18385 states to 18385 states and 30638 transitions. [2025-01-09 03:46:49,089 INFO L78 Accepts]: Start accepts. Automaton has 18385 states and 30638 transitions. Word has length 136 [2025-01-09 03:46:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:49,089 INFO L471 AbstractCegarLoop]: Abstraction has 18385 states and 30638 transitions. [2025-01-09 03:46:49,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:46:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 18385 states and 30638 transitions. [2025-01-09 03:46:49,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 03:46:49,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:49,095 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:49,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:46:49,095 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:49,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2108416883, now seen corresponding path program 1 times [2025-01-09 03:46:49,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:49,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925259620] [2025-01-09 03:46:49,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:49,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:49,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 03:46:49,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 03:46:49,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:49,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:46:49,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:49,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925259620] [2025-01-09 03:46:49,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925259620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:49,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:49,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:46:49,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827954972] [2025-01-09 03:46:49,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:49,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:46:49,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:49,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:46:49,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:46:49,263 INFO L87 Difference]: Start difference. First operand 18385 states and 30638 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:46:50,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:50,935 INFO L93 Difference]: Finished difference Result 55241 states and 95558 transitions. [2025-01-09 03:46:50,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:46:50,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-01-09 03:46:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:51,157 INFO L225 Difference]: With dead ends: 55241 [2025-01-09 03:46:51,158 INFO L226 Difference]: Without dead ends: 36874 [2025-01-09 03:46:51,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:46:51,273 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 863 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 4388 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:51,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 4388 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:46:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36874 states. [2025-01-09 03:46:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36874 to 36709. [2025-01-09 03:46:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36709 states, 28227 states have (on average 1.5916321252701315) internal successors, (44927), 29268 states have internal predecessors, (44927), 6588 states have call successors, (6588), 1862 states have call predecessors, (6588), 1893 states have return successors, (11427), 6602 states have call predecessors, (11427), 6554 states have call successors, (11427) [2025-01-09 03:46:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36709 states to 36709 states and 62942 transitions. [2025-01-09 03:46:52,881 INFO L78 Accepts]: Start accepts. Automaton has 36709 states and 62942 transitions. Word has length 145 [2025-01-09 03:46:52,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:52,883 INFO L471 AbstractCegarLoop]: Abstraction has 36709 states and 62942 transitions. [2025-01-09 03:46:52,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:46:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 36709 states and 62942 transitions. [2025-01-09 03:46:52,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 03:46:52,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:52,888 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:52,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:46:52,888 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:52,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:52,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1028123961, now seen corresponding path program 1 times [2025-01-09 03:46:52,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:52,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946493171] [2025-01-09 03:46:52,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:52,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:52,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 03:46:52,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 03:46:52,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:52,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:46:52,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:52,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946493171] [2025-01-09 03:46:52,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946493171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:52,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:52,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:52,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219997651] [2025-01-09 03:46:52,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:52,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:52,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:52,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:52,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:52,965 INFO L87 Difference]: Start difference. First operand 36709 states and 62942 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:46:55,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:55,022 INFO L93 Difference]: Finished difference Result 73688 states and 129540 transitions. [2025-01-09 03:46:55,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:46:55,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2025-01-09 03:46:55,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:55,291 INFO L225 Difference]: With dead ends: 73688 [2025-01-09 03:46:55,291 INFO L226 Difference]: Without dead ends: 36997 [2025-01-09 03:46:55,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:46:55,667 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 11 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:55,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2570 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:46:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36997 states. [2025-01-09 03:46:56,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36997 to 36869. [2025-01-09 03:46:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36869 states, 28371 states have (on average 1.5891931902294596) internal successors, (45087), 29412 states have internal predecessors, (45087), 6588 states have call successors, (6588), 1894 states have call predecessors, (6588), 1909 states have return successors, (11371), 6586 states have call predecessors, (11371), 6554 states have call successors, (11371) [2025-01-09 03:46:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36869 states to 36869 states and 63046 transitions. [2025-01-09 03:46:57,225 INFO L78 Accepts]: Start accepts. Automaton has 36869 states and 63046 transitions. Word has length 146 [2025-01-09 03:46:57,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:57,226 INFO L471 AbstractCegarLoop]: Abstraction has 36869 states and 63046 transitions. [2025-01-09 03:46:57,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:46:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand 36869 states and 63046 transitions. [2025-01-09 03:46:57,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 03:46:57,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:57,232 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:57,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:46:57,232 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:57,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:57,233 INFO L85 PathProgramCache]: Analyzing trace with hash 604887381, now seen corresponding path program 1 times [2025-01-09 03:46:57,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:57,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554664474] [2025-01-09 03:46:57,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:57,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:57,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 03:46:57,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 03:46:57,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:57,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:46:57,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:57,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554664474] [2025-01-09 03:46:57,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554664474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:57,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:57,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:46:57,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788073897] [2025-01-09 03:46:57,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:57,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:46:57,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:57,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:46:57,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:46:57,358 INFO L87 Difference]: Start difference. First operand 36869 states and 63046 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:47:01,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:01,638 INFO L93 Difference]: Finished difference Result 110929 states and 200578 transitions. [2025-01-09 03:47:01,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:01,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 156 [2025-01-09 03:47:01,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:02,287 INFO L225 Difference]: With dead ends: 110929 [2025-01-09 03:47:02,288 INFO L226 Difference]: Without dead ends: 74078 [2025-01-09 03:47:02,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:47:02,605 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 858 mSDsluCounter, 3426 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 4362 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:02,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 4362 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 03:47:02,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74078 states. [2025-01-09 03:47:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74078 to 73785. [2025-01-09 03:47:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73785 states, 56786 states have (on average 1.5865882435811645) internal successors, (90096), 58859 states have internal predecessors, (90096), 13153 states have call successors, (13153), 3782 states have call predecessors, (13153), 3845 states have return successors, (28385), 13191 states have call predecessors, (28385), 13087 states have call successors, (28385) [2025-01-09 03:47:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73785 states to 73785 states and 131634 transitions. [2025-01-09 03:47:06,550 INFO L78 Accepts]: Start accepts. Automaton has 73785 states and 131634 transitions. Word has length 156 [2025-01-09 03:47:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:06,550 INFO L471 AbstractCegarLoop]: Abstraction has 73785 states and 131634 transitions. [2025-01-09 03:47:06,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:47:06,550 INFO L276 IsEmpty]: Start isEmpty. Operand 73785 states and 131634 transitions. [2025-01-09 03:47:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 03:47:06,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:06,559 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:47:06,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:47:06,559 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:06,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:06,559 INFO L85 PathProgramCache]: Analyzing trace with hash 807097197, now seen corresponding path program 1 times [2025-01-09 03:47:06,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:06,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251305476] [2025-01-09 03:47:06,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:06,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:06,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 03:47:06,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 03:47:06,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:06,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 03:47:06,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:06,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251305476] [2025-01-09 03:47:06,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251305476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:06,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:06,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:06,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140817150] [2025-01-09 03:47:06,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:06,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:06,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:06,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:06,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:06,683 INFO L87 Difference]: Start difference. First operand 73785 states and 131634 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:47:11,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:11,501 INFO L93 Difference]: Finished difference Result 148192 states and 274705 transitions. [2025-01-09 03:47:11,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:47:11,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 157 [2025-01-09 03:47:11,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:11,983 INFO L225 Difference]: With dead ends: 148192 [2025-01-09 03:47:11,984 INFO L226 Difference]: Without dead ends: 74425 [2025-01-09 03:47:12,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:47:12,924 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 10 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:12,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2570 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74425 states. [2025-01-09 03:47:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74425 to 74169. [2025-01-09 03:47:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74169 states, 57138 states have (on average 1.5835346004410376) internal successors, (90480), 59211 states have internal predecessors, (90480), 13153 states have call successors, (13153), 3846 states have call predecessors, (13153), 3877 states have return successors, (28321), 13159 states have call predecessors, (28321), 13087 states have call successors, (28321) [2025-01-09 03:47:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74169 states to 74169 states and 131954 transitions. [2025-01-09 03:47:16,837 INFO L78 Accepts]: Start accepts. Automaton has 74169 states and 131954 transitions. Word has length 157 [2025-01-09 03:47:16,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:16,837 INFO L471 AbstractCegarLoop]: Abstraction has 74169 states and 131954 transitions. [2025-01-09 03:47:16,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:47:16,838 INFO L276 IsEmpty]: Start isEmpty. Operand 74169 states and 131954 transitions. [2025-01-09 03:47:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 03:47:16,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:16,844 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:47:16,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:47:16,844 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:16,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash 416110021, now seen corresponding path program 1 times [2025-01-09 03:47:16,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:16,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850346397] [2025-01-09 03:47:16,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:16,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:16,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 03:47:16,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 03:47:16,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:16,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 03:47:17,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:17,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850346397] [2025-01-09 03:47:17,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850346397] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:47:17,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060330378] [2025-01-09 03:47:17,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:17,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:47:17,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:17,215 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:47:17,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:47:17,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 03:47:17,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 03:47:17,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:17,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:17,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 1749 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 03:47:17,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:47:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 03:47:17,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:47:17,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060330378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:17,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:47:17,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-01-09 03:47:17,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417247985] [2025-01-09 03:47:17,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:17,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:17,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:17,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:17,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:47:17,566 INFO L87 Difference]: Start difference. First operand 74169 states and 131954 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20)