./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product27.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_spec9_product27.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 11bb1f05736dca729c358ce9b340534ff3d0ef3cd2b5d7b8f4dea43dade9112f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:48:07,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:48:07,468 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:48:07,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:48:07,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:48:07,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:48:07,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:48:07,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:48:07,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:48:07,498 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:48:07,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:48:07,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:48:07,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:48:07,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:48:07,499 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:48:07,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:48:07,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:48:07,499 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:48:07,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:48:07,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:48:07,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:48:07,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:48:07,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:48:07,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:48:07,499 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:48:07,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:48:07,500 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:48:07,500 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:48:07,500 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:48:07,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:48:07,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:48:07,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:48:07,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:07,500 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:48:07,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:48:07,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:48:07,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:48:07,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:07,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:48:07,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:48:07,501 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:48:07,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:48:07,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:48:07,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:48:07,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:48:07,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:48:07,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:48:07,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:48:07,501 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 -> 11bb1f05736dca729c358ce9b340534ff3d0ef3cd2b5d7b8f4dea43dade9112f [2025-01-09 03:48:07,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:48:07,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:48:07,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:48:07,725 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:48:07,725 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:48:07,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product27.cil.c [2025-01-09 03:48:08,893 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa0f3a53f/9928fb83e0004827b8cbc8fb72685efd/FLAG3c612fd37 [2025-01-09 03:48:09,176 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:48:09,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product27.cil.c [2025-01-09 03:48:09,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa0f3a53f/9928fb83e0004827b8cbc8fb72685efd/FLAG3c612fd37 [2025-01-09 03:48:09,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa0f3a53f/9928fb83e0004827b8cbc8fb72685efd [2025-01-09 03:48:09,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:48:09,212 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:48:09,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:48:09,214 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:48:09,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:48:09,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:09" (1/1) ... [2025-01-09 03:48:09,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb036d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:09, skipping insertion in model container [2025-01-09 03:48:09,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:09" (1/1) ... [2025-01-09 03:48:09,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:48:09,646 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_spec9_product27.cil.c[66437,66450] [2025-01-09 03:48:09,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:48:09,671 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:48:09,680 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-01-09 03:48:09,681 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [414] [2025-01-09 03:48:09,682 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [516] [2025-01-09 03:48:09,682 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [873] [2025-01-09 03:48:09,682 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2432] [2025-01-09 03:48:09,682 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3093] [2025-01-09 03:48:09,682 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3105] [2025-01-09 03:48:09,682 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [3114] [2025-01-09 03:48:09,682 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3273] [2025-01-09 03:48:09,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3308] [2025-01-09 03:48:09,773 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_spec9_product27.cil.c[66437,66450] [2025-01-09 03:48:09,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:48:09,799 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:48:09,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:09 WrapperNode [2025-01-09 03:48:09,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:48:09,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:48:09,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:48:09,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:48:09,805 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:48:09" (1/1) ... [2025-01-09 03:48:09,828 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:48:09" (1/1) ... [2025-01-09 03:48:09,868 INFO L138 Inliner]: procedures = 95, calls = 339, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 1118 [2025-01-09 03:48:09,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:48:09,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:48:09,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:48:09,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:48:09,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:09" (1/1) ... [2025-01-09 03:48:09,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:09" (1/1) ... [2025-01-09 03:48:09,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:09" (1/1) ... [2025-01-09 03:48:09,903 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:48:09,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:09" (1/1) ... [2025-01-09 03:48:09,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:09" (1/1) ... [2025-01-09 03:48:09,919 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:09" (1/1) ... [2025-01-09 03:48:09,921 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:09" (1/1) ... [2025-01-09 03:48:09,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:09" (1/1) ... [2025-01-09 03:48:09,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:09" (1/1) ... [2025-01-09 03:48:09,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:09" (1/1) ... [2025-01-09 03:48:09,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:48:09,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:48:09,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:48:09,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:48:09,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:09" (1/1) ... [2025-01-09 03:48:09,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:09,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:09,987 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:48:09,989 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:48:10,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:48:10,010 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:48:10,010 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:48:10,011 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-01-09 03:48:10,011 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-01-09 03:48:10,011 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:48:10,011 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:48:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-01-09 03:48:10,012 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-01-09 03:48:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:48:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:48:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:48:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:48:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:48:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:48:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:48:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:48:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:48:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:48:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:48:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:48:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:48:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:48:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:48:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:48:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-01-09 03:48:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-01-09 03:48:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:48:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:48:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-01-09 03:48:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-01-09 03:48:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:48:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:48:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:48:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:48:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:48:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:48:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:48:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:48:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-01-09 03:48:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:48:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:48:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:48:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:48:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:48:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:48:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:48:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:48:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:48:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:48:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:48:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:48:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:48:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:48:10,163 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:48:10,164 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:48:11,055 INFO L? ?]: Removed 455 outVars from TransFormulas that were not future-live. [2025-01-09 03:48:11,055 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:48:11,073 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:48:11,073 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:48:11,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:11 BoogieIcfgContainer [2025-01-09 03:48:11,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:48:11,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:48:11,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:48:11,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:48:11,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:48:09" (1/3) ... [2025-01-09 03:48:11,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bd227d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:11, skipping insertion in model container [2025-01-09 03:48:11,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:09" (2/3) ... [2025-01-09 03:48:11,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bd227d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:11, skipping insertion in model container [2025-01-09 03:48:11,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:11" (3/3) ... [2025-01-09 03:48:11,081 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product27.cil.c [2025-01-09 03:48:11,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:48:11,095 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product27.cil.c that has 25 procedures, 559 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:48:11,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:48:11,163 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;@469149ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:48:11,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:48:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 559 states, 440 states have (on average 1.6931818181818181) internal successors, (745), 461 states have internal predecessors, (745), 93 states have call successors, (93), 24 states have call predecessors, (93), 24 states have return successors, (93), 87 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 03:48:11,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 03:48:11,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:11,197 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 03:48:11,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:11,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:11,202 INFO L85 PathProgramCache]: Analyzing trace with hash 71355059, now seen corresponding path program 1 times [2025-01-09 03:48:11,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:11,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540254338] [2025-01-09 03:48:11,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:11,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:11,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 03:48:11,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 03:48:11,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:11,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:11,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:11,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540254338] [2025-01-09 03:48:11,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540254338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:11,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:11,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:11,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755204297] [2025-01-09 03:48:11,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:11,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:11,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:11,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:11,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:11,715 INFO L87 Difference]: Start difference. First operand has 559 states, 440 states have (on average 1.6931818181818181) internal successors, (745), 461 states have internal predecessors, (745), 93 states have call successors, (93), 24 states have call predecessors, (93), 24 states have return successors, (93), 87 states have call predecessors, (93), 93 states have call successors, (93) Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:11,848 INFO L93 Difference]: Finished difference Result 1098 states and 1837 transitions. [2025-01-09 03:48:11,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:11,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2025-01-09 03:48:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:11,862 INFO L225 Difference]: With dead ends: 1098 [2025-01-09 03:48:11,863 INFO L226 Difference]: Without dead ends: 551 [2025-01-09 03:48:11,871 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:48:11,873 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 5 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2729 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:11,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2729 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:11,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-01-09 03:48:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-01-09 03:48:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 434 states have (on average 1.6912442396313363) internal successors, (734), 453 states have internal predecessors, (734), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 03:48:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 915 transitions. [2025-01-09 03:48:11,947 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 915 transitions. Word has length 104 [2025-01-09 03:48:11,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:11,948 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 915 transitions. [2025-01-09 03:48:11,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:11,949 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 915 transitions. [2025-01-09 03:48:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:48:11,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:11,958 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 03:48:11,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:48:11,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:11,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:11,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1532761336, now seen corresponding path program 1 times [2025-01-09 03:48:11,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:11,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574993317] [2025-01-09 03:48:11,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:11,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:11,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:48:12,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:48:12,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:12,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:12,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:12,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574993317] [2025-01-09 03:48:12,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574993317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:12,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:12,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:12,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810185197] [2025-01-09 03:48:12,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:12,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:12,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:12,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:12,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:12,185 INFO L87 Difference]: Start difference. First operand 551 states and 915 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:12,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:12,249 INFO L93 Difference]: Finished difference Result 1084 states and 1807 transitions. [2025-01-09 03:48:12,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:12,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 106 [2025-01-09 03:48:12,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:12,253 INFO L225 Difference]: With dead ends: 1084 [2025-01-09 03:48:12,254 INFO L226 Difference]: Without dead ends: 551 [2025-01-09 03:48:12,257 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:48:12,257 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 4 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:12,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2708 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-01-09 03:48:12,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-01-09 03:48:12,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 434 states have (on average 1.6889400921658986) internal successors, (733), 453 states have internal predecessors, (733), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 03:48:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 914 transitions. [2025-01-09 03:48:12,290 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 914 transitions. Word has length 106 [2025-01-09 03:48:12,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:12,290 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 914 transitions. [2025-01-09 03:48:12,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 914 transitions. [2025-01-09 03:48:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:48:12,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:12,293 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 03:48:12,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:48:12,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:12,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:12,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1842725198, now seen corresponding path program 1 times [2025-01-09 03:48:12,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:12,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935198565] [2025-01-09 03:48:12,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:12,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:12,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:48:12,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:48:12,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:12,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:12,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:12,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935198565] [2025-01-09 03:48:12,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935198565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:12,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:12,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:12,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541635643] [2025-01-09 03:48:12,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:12,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:12,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:12,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:12,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:12,442 INFO L87 Difference]: Start difference. First operand 551 states and 914 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:12,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:12,496 INFO L93 Difference]: Finished difference Result 1084 states and 1806 transitions. [2025-01-09 03:48:12,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:12,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2025-01-09 03:48:12,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:12,503 INFO L225 Difference]: With dead ends: 1084 [2025-01-09 03:48:12,503 INFO L226 Difference]: Without dead ends: 551 [2025-01-09 03:48:12,505 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:48:12,506 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 3 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2708 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:48:12,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2708 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-01-09 03:48:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-01-09 03:48:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 434 states have (on average 1.6866359447004609) internal successors, (732), 453 states have internal predecessors, (732), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 03:48:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 913 transitions. [2025-01-09 03:48:12,534 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 913 transitions. Word has length 107 [2025-01-09 03:48:12,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:12,535 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 913 transitions. [2025-01-09 03:48:12,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 913 transitions. [2025-01-09 03:48:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:48:12,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:12,541 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 03:48:12,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:48:12,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:12,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash -333721012, now seen corresponding path program 1 times [2025-01-09 03:48:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:12,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280685770] [2025-01-09 03:48:12,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:12,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:12,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:48:12,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:48:12,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:12,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:12,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:12,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280685770] [2025-01-09 03:48:12,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280685770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:12,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:12,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:12,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234635027] [2025-01-09 03:48:12,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:12,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:12,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:12,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:12,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:12,681 INFO L87 Difference]: Start difference. First operand 551 states and 913 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:12,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:12,722 INFO L93 Difference]: Finished difference Result 1084 states and 1805 transitions. [2025-01-09 03:48:12,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:12,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 108 [2025-01-09 03:48:12,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:12,726 INFO L225 Difference]: With dead ends: 1084 [2025-01-09 03:48:12,728 INFO L226 Difference]: Without dead ends: 551 [2025-01-09 03:48:12,730 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:48:12,731 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 2 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:12,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2708 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-01-09 03:48:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-01-09 03:48:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 434 states have (on average 1.6843317972350231) internal successors, (731), 453 states have internal predecessors, (731), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 03:48:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 912 transitions. [2025-01-09 03:48:12,746 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 912 transitions. Word has length 108 [2025-01-09 03:48:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:12,746 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 912 transitions. [2025-01-09 03:48:12,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 912 transitions. [2025-01-09 03:48:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:48:12,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:12,750 INFO L218 NwaCegarLoop]: trace histogram [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:48:12,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:48:12,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:12,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:12,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1728717814, now seen corresponding path program 1 times [2025-01-09 03:48:12,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:12,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081682413] [2025-01-09 03:48:12,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:12,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:12,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:48:12,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:48:12,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:12,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:12,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:12,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081682413] [2025-01-09 03:48:12,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081682413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:12,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:12,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:12,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898291847] [2025-01-09 03:48:12,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:12,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:12,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:12,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:12,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:12,872 INFO L87 Difference]: Start difference. First operand 551 states and 912 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, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:12,908 INFO L93 Difference]: Finished difference Result 1084 states and 1804 transitions. [2025-01-09 03:48:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:12,908 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, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2025-01-09 03:48:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:12,913 INFO L225 Difference]: With dead ends: 1084 [2025-01-09 03:48:12,913 INFO L226 Difference]: Without dead ends: 551 [2025-01-09 03:48:12,915 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:48:12,916 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 1 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:12,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2708 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:12,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-01-09 03:48:12,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-01-09 03:48:12,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 434 states have (on average 1.6820276497695852) internal successors, (730), 453 states have internal predecessors, (730), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 03:48:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 911 transitions. [2025-01-09 03:48:12,948 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 911 transitions. Word has length 109 [2025-01-09 03:48:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:12,948 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 911 transitions. [2025-01-09 03:48:12,948 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, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 911 transitions. [2025-01-09 03:48:12,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:48:12,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:12,951 INFO L218 NwaCegarLoop]: trace histogram [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:48:12,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:48:12,951 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:12,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:12,951 INFO L85 PathProgramCache]: Analyzing trace with hash -527206000, now seen corresponding path program 1 times [2025-01-09 03:48:12,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:12,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021874086] [2025-01-09 03:48:12,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:12,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:12,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:48:12,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:48:12,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:12,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:13,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:13,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021874086] [2025-01-09 03:48:13,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021874086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:13,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:13,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:13,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027628507] [2025-01-09 03:48:13,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:13,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:13,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:13,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:13,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:13,121 INFO L87 Difference]: Start difference. First operand 551 states and 911 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:48:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:13,196 INFO L93 Difference]: Finished difference Result 1050 states and 1736 transitions. [2025-01-09 03:48:13,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:13,197 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-01-09 03:48:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:13,201 INFO L225 Difference]: With dead ends: 1050 [2025-01-09 03:48:13,201 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 03:48:13,203 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:48:13,205 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 91 mSDsluCounter, 4424 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5325 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:13,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5325 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 03:48:13,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 564. [2025-01-09 03:48:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 444 states have (on average 1.677927927927928) internal successors, (745), 465 states have internal predecessors, (745), 94 states have call successors, (94), 24 states have call predecessors, (94), 25 states have return successors, (91), 87 states have call predecessors, (91), 89 states have call successors, (91) [2025-01-09 03:48:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 930 transitions. [2025-01-09 03:48:13,252 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 930 transitions. Word has length 110 [2025-01-09 03:48:13,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:13,253 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 930 transitions. [2025-01-09 03:48:13,253 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:48:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 930 transitions. [2025-01-09 03:48:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:48:13,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:13,258 INFO L218 NwaCegarLoop]: trace histogram [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:48:13,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:48:13,258 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:13,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:13,259 INFO L85 PathProgramCache]: Analyzing trace with hash -968960495, now seen corresponding path program 1 times [2025-01-09 03:48:13,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:13,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653425456] [2025-01-09 03:48:13,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:13,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:13,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:48:13,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:48:13,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:13,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:13,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:13,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653425456] [2025-01-09 03:48:13,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653425456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:13,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:13,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:13,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883375810] [2025-01-09 03:48:13,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:13,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:13,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:13,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:13,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:13,359 INFO L87 Difference]: Start difference. First operand 564 states and 930 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:13,402 INFO L93 Difference]: Finished difference Result 1102 states and 1830 transitions. [2025-01-09 03:48:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:13,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2025-01-09 03:48:13,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:13,406 INFO L225 Difference]: With dead ends: 1102 [2025-01-09 03:48:13,406 INFO L226 Difference]: Without dead ends: 545 [2025-01-09 03:48:13,408 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:48:13,408 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 0 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:13,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2710 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:13,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-01-09 03:48:13,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-01-09 03:48:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.6728971962616823) internal successors, (716), 447 states have internal predecessors, (716), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 03:48:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 897 transitions. [2025-01-09 03:48:13,425 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 897 transitions. Word has length 110 [2025-01-09 03:48:13,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:13,425 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 897 transitions. [2025-01-09 03:48:13,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:13,425 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 897 transitions. [2025-01-09 03:48:13,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 03:48:13,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:13,428 INFO L218 NwaCegarLoop]: trace histogram [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:48:13,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:48:13,428 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:13,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:13,429 INFO L85 PathProgramCache]: Analyzing trace with hash -305843309, now seen corresponding path program 1 times [2025-01-09 03:48:13,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:13,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238612517] [2025-01-09 03:48:13,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:13,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:13,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 03:48:13,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 03:48:13,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:13,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:13,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:13,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238612517] [2025-01-09 03:48:13,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238612517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:13,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:13,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:13,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872128220] [2025-01-09 03:48:13,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:13,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:13,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:13,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:13,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:13,567 INFO L87 Difference]: Start difference. First operand 545 states and 897 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:13,729 INFO L93 Difference]: Finished difference Result 1047 states and 1728 transitions. [2025-01-09 03:48:13,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:13,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2025-01-09 03:48:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:13,734 INFO L225 Difference]: With dead ends: 1047 [2025-01-09 03:48:13,735 INFO L226 Difference]: Without dead ends: 554 [2025-01-09 03:48:13,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:13,738 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 55 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:13,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4241 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-01-09 03:48:13,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 545. [2025-01-09 03:48:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.6635514018691588) internal successors, (712), 447 states have internal predecessors, (712), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 03:48:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 893 transitions. [2025-01-09 03:48:13,760 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 893 transitions. Word has length 111 [2025-01-09 03:48:13,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:13,761 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 893 transitions. [2025-01-09 03:48:13,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 893 transitions. [2025-01-09 03:48:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:48:13,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:13,764 INFO L218 NwaCegarLoop]: trace histogram [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:48:13,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:48:13,765 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:13,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:13,765 INFO L85 PathProgramCache]: Analyzing trace with hash -757596819, now seen corresponding path program 1 times [2025-01-09 03:48:13,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:13,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149016687] [2025-01-09 03:48:13,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:13,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:13,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:48:13,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:48:13,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:13,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:13,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:13,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149016687] [2025-01-09 03:48:13,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149016687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:13,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:13,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:13,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620734107] [2025-01-09 03:48:13,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:13,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:13,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:13,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:13,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:13,903 INFO L87 Difference]: Start difference. First operand 545 states and 893 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:14,049 INFO L93 Difference]: Finished difference Result 1047 states and 1724 transitions. [2025-01-09 03:48:14,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:14,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 112 [2025-01-09 03:48:14,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:14,054 INFO L225 Difference]: With dead ends: 1047 [2025-01-09 03:48:14,054 INFO L226 Difference]: Without dead ends: 554 [2025-01-09 03:48:14,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:14,056 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 54 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:14,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4241 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-01-09 03:48:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 545. [2025-01-09 03:48:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.6542056074766356) internal successors, (708), 447 states have internal predecessors, (708), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 03:48:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 889 transitions. [2025-01-09 03:48:14,071 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 889 transitions. Word has length 112 [2025-01-09 03:48:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:14,072 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 889 transitions. [2025-01-09 03:48:14,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 889 transitions. [2025-01-09 03:48:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:48:14,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:14,074 INFO L218 NwaCegarLoop]: trace histogram [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:48:14,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:48:14,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:14,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:14,075 INFO L85 PathProgramCache]: Analyzing trace with hash -331039762, now seen corresponding path program 1 times [2025-01-09 03:48:14,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:14,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505695701] [2025-01-09 03:48:14,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:14,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:14,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:48:14,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:48:14,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:14,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:14,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:14,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505695701] [2025-01-09 03:48:14,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505695701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:14,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:14,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:14,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779145152] [2025-01-09 03:48:14,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:14,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:14,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:14,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:14,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:14,190 INFO L87 Difference]: Start difference. First operand 545 states and 889 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:14,320 INFO L93 Difference]: Finished difference Result 1047 states and 1720 transitions. [2025-01-09 03:48:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:14,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2025-01-09 03:48:14,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:14,325 INFO L225 Difference]: With dead ends: 1047 [2025-01-09 03:48:14,325 INFO L226 Difference]: Without dead ends: 554 [2025-01-09 03:48:14,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:14,327 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 53 mSDsluCounter, 3370 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4223 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:14,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4223 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-01-09 03:48:14,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 545. [2025-01-09 03:48:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.644859813084112) internal successors, (704), 447 states have internal predecessors, (704), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 03:48:14,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 885 transitions. [2025-01-09 03:48:14,341 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 885 transitions. Word has length 113 [2025-01-09 03:48:14,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:14,341 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 885 transitions. [2025-01-09 03:48:14,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:14,341 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 885 transitions. [2025-01-09 03:48:14,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:48:14,343 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:14,343 INFO L218 NwaCegarLoop]: trace histogram [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:48:14,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:48:14,344 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:14,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1640730478, now seen corresponding path program 1 times [2025-01-09 03:48:14,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:14,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13860252] [2025-01-09 03:48:14,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:14,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:14,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:48:14,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:48:14,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:14,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:14,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:14,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13860252] [2025-01-09 03:48:14,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13860252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:14,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:14,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:14,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802976272] [2025-01-09 03:48:14,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:14,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:14,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:14,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:14,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:14,475 INFO L87 Difference]: Start difference. First operand 545 states and 885 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:48:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:14,527 INFO L93 Difference]: Finished difference Result 1038 states and 1702 transitions. [2025-01-09 03:48:14,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:14,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2025-01-09 03:48:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:14,531 INFO L225 Difference]: With dead ends: 1038 [2025-01-09 03:48:14,531 INFO L226 Difference]: Without dead ends: 524 [2025-01-09 03:48:14,533 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:48:14,533 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 84 mSDsluCounter, 4297 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5171 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:14,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5171 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:14,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-01-09 03:48:14,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-01-09 03:48:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 407 states have (on average 1.6461916461916462) internal successors, (670), 426 states have internal predecessors, (670), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 03:48:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 851 transitions. [2025-01-09 03:48:14,547 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 851 transitions. Word has length 113 [2025-01-09 03:48:14,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:14,548 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 851 transitions. [2025-01-09 03:48:14,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:48:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 851 transitions. [2025-01-09 03:48:14,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:48:14,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:14,550 INFO L218 NwaCegarLoop]: trace histogram [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:48:14,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:48:14,550 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:14,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:14,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1553341096, now seen corresponding path program 1 times [2025-01-09 03:48:14,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:14,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59393553] [2025-01-09 03:48:14,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:14,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:14,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:48:14,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:48:14,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:14,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:14,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:14,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59393553] [2025-01-09 03:48:14,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59393553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:14,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:14,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385800412] [2025-01-09 03:48:14,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:14,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:14,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:14,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:14,647 INFO L87 Difference]: Start difference. First operand 524 states and 851 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:14,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:14,703 INFO L93 Difference]: Finished difference Result 1017 states and 1668 transitions. [2025-01-09 03:48:14,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:14,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2025-01-09 03:48:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:14,707 INFO L225 Difference]: With dead ends: 1017 [2025-01-09 03:48:14,707 INFO L226 Difference]: Without dead ends: 524 [2025-01-09 03:48:14,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:14,709 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 17 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4161 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:14,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4161 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:14,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-01-09 03:48:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-01-09 03:48:14,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 407 states have (on average 1.6437346437346438) internal successors, (669), 426 states have internal predecessors, (669), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 03:48:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 850 transitions. [2025-01-09 03:48:14,723 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 850 transitions. Word has length 114 [2025-01-09 03:48:14,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:14,723 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 850 transitions. [2025-01-09 03:48:14,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 850 transitions. [2025-01-09 03:48:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:48:14,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:14,726 INFO L218 NwaCegarLoop]: trace histogram [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:48:14,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:48:14,726 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:14,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:14,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1385619529, now seen corresponding path program 1 times [2025-01-09 03:48:14,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:14,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054056135] [2025-01-09 03:48:14,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:14,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:14,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:48:14,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:48:14,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:14,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:14,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:14,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054056135] [2025-01-09 03:48:14,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054056135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:14,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:14,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:14,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798869008] [2025-01-09 03:48:14,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:14,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:14,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:14,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:14,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:14,840 INFO L87 Difference]: Start difference. First operand 524 states and 850 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:14,893 INFO L93 Difference]: Finished difference Result 1017 states and 1667 transitions. [2025-01-09 03:48:14,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:14,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2025-01-09 03:48:14,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:14,898 INFO L225 Difference]: With dead ends: 1017 [2025-01-09 03:48:14,898 INFO L226 Difference]: Without dead ends: 524 [2025-01-09 03:48:14,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:14,900 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 16 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4161 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:14,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4161 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-01-09 03:48:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-01-09 03:48:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 407 states have (on average 1.6412776412776413) internal successors, (668), 426 states have internal predecessors, (668), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 03:48:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 849 transitions. [2025-01-09 03:48:14,914 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 849 transitions. Word has length 115 [2025-01-09 03:48:14,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:14,914 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 849 transitions. [2025-01-09 03:48:14,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 849 transitions. [2025-01-09 03:48:14,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:48:14,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:14,917 INFO L218 NwaCegarLoop]: trace histogram [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:48:14,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:48:14,917 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:14,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:14,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2027232227, now seen corresponding path program 1 times [2025-01-09 03:48:14,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:14,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229800331] [2025-01-09 03:48:14,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:14,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:14,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:48:14,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:48:14,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:14,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:14,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:14,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229800331] [2025-01-09 03:48:14,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229800331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:14,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:14,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:14,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683985772] [2025-01-09 03:48:14,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:14,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:14,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:14,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:14,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:14,989 INFO L87 Difference]: Start difference. First operand 524 states and 849 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:15,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:15,019 INFO L93 Difference]: Finished difference Result 1011 states and 1655 transitions. [2025-01-09 03:48:15,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:15,020 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2025-01-09 03:48:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:15,024 INFO L225 Difference]: With dead ends: 1011 [2025-01-09 03:48:15,024 INFO L226 Difference]: Without dead ends: 524 [2025-01-09 03:48:15,025 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:48:15,026 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 5 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:15,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2501 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-01-09 03:48:15,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-01-09 03:48:15,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 407 states have (on average 1.6388206388206388) internal successors, (667), 426 states have internal predecessors, (667), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 03:48:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 848 transitions. [2025-01-09 03:48:15,041 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 848 transitions. Word has length 116 [2025-01-09 03:48:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:15,042 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 848 transitions. [2025-01-09 03:48:15,042 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:48:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 848 transitions. [2025-01-09 03:48:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:48:15,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:15,044 INFO L218 NwaCegarLoop]: trace histogram [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:48:15,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:48:15,044 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:15,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:15,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2074338860, now seen corresponding path program 1 times [2025-01-09 03:48:15,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:15,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647462991] [2025-01-09 03:48:15,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:15,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:15,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:48:15,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:48:15,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:15,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:48:15,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:15,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647462991] [2025-01-09 03:48:15,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647462991] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:15,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040058937] [2025-01-09 03:48:15,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:15,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:15,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:15,153 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:48:15,155 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:48:15,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:48:15,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:48:15,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:15,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:15,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:15,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:15,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:15,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040058937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:15,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:15,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:48:15,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895213972] [2025-01-09 03:48:15,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:15,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:15,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:15,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:15,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:15,466 INFO L87 Difference]: Start difference. First operand 524 states and 848 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 03:48:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:15,513 INFO L93 Difference]: Finished difference Result 1473 states and 2441 transitions. [2025-01-09 03:48:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:15,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 117 [2025-01-09 03:48:15,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:15,520 INFO L225 Difference]: With dead ends: 1473 [2025-01-09 03:48:15,520 INFO L226 Difference]: Without dead ends: 994 [2025-01-09 03:48:15,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 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:48:15,523 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 833 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:15,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1754 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-01-09 03:48:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 992. [2025-01-09 03:48:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 772 states have (on average 1.660621761658031) internal successors, (1282), 805 states have internal predecessors, (1282), 176 states have call successors, (176), 43 states have call predecessors, (176), 43 states have return successors, (181), 169 states have call predecessors, (181), 171 states have call successors, (181) [2025-01-09 03:48:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1639 transitions. [2025-01-09 03:48:15,558 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1639 transitions. Word has length 117 [2025-01-09 03:48:15,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:15,558 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1639 transitions. [2025-01-09 03:48:15,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 03:48:15,558 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1639 transitions. [2025-01-09 03:48:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:48:15,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:15,561 INFO L218 NwaCegarLoop]: trace histogram [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:48:15,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:48:15,761 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,SelfDestructingSolverStorable14 [2025-01-09 03:48:15,762 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:15,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:15,762 INFO L85 PathProgramCache]: Analyzing trace with hash 119873854, now seen corresponding path program 1 times [2025-01-09 03:48:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:15,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675667823] [2025-01-09 03:48:15,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:15,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:15,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:48:15,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:48:15,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:15,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:48:15,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:15,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675667823] [2025-01-09 03:48:15,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675667823] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:15,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788851567] [2025-01-09 03:48:15,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:15,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:15,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:15,857 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:48:15,858 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:48:15,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:48:16,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:48:16,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:16,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:16,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 1468 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:16,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:16,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:16,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788851567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:16,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:16,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:48:16,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012257259] [2025-01-09 03:48:16,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:16,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:16,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:16,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:16,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:16,175 INFO L87 Difference]: Start difference. First operand 992 states and 1639 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 03:48:16,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:16,243 INFO L93 Difference]: Finished difference Result 2879 states and 4832 transitions. [2025-01-09 03:48:16,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:16,243 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), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 118 [2025-01-09 03:48:16,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:16,259 INFO L225 Difference]: With dead ends: 2879 [2025-01-09 03:48:16,259 INFO L226 Difference]: Without dead ends: 1932 [2025-01-09 03:48:16,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 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:48:16,264 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 832 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:16,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 1710 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:16,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2025-01-09 03:48:16,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1929. [2025-01-09 03:48:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1503 states have (on average 1.6719893546240852) internal successors, (2513), 1564 states have internal predecessors, (2513), 342 states have call successors, (342), 81 states have call predecessors, (342), 83 states have return successors, (379), 335 states have call predecessors, (379), 337 states have call successors, (379) [2025-01-09 03:48:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 3234 transitions. [2025-01-09 03:48:16,340 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 3234 transitions. Word has length 118 [2025-01-09 03:48:16,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:16,340 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 3234 transitions. [2025-01-09 03:48:16,341 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), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 03:48:16,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 3234 transitions. [2025-01-09 03:48:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:48:16,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:16,344 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 03:48:16,352 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:48:16,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 03:48:16,545 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:16,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:16,545 INFO L85 PathProgramCache]: Analyzing trace with hash -579004842, now seen corresponding path program 1 times [2025-01-09 03:48:16,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:16,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427549847] [2025-01-09 03:48:16,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:16,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:16,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:48:16,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:48:16,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:16,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:48:16,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:16,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427549847] [2025-01-09 03:48:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427549847] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:16,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534865568] [2025-01-09 03:48:16,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:16,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:16,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:16,644 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:48:16,646 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:48:16,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:48:16,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:48:16,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:16,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:16,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 1470 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:16,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:16,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:16,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534865568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:16,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:16,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:48:16,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051614249] [2025-01-09 03:48:16,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:16,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:16,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:16,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:16,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:16,972 INFO L87 Difference]: Start difference. First operand 1929 states and 3234 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 03:48:17,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:17,082 INFO L93 Difference]: Finished difference Result 5692 states and 9668 transitions. [2025-01-09 03:48:17,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:17,082 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), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 119 [2025-01-09 03:48:17,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:17,110 INFO L225 Difference]: With dead ends: 5692 [2025-01-09 03:48:17,110 INFO L226 Difference]: Without dead ends: 3808 [2025-01-09 03:48:17,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 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:48:17,121 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 830 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:17,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1704 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:17,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3808 states. [2025-01-09 03:48:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3808 to 3804. [2025-01-09 03:48:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3804 states, 2966 states have (on average 1.677343223196224) internal successors, (4975), 3083 states have internal predecessors, (4975), 674 states have call successors, (674), 157 states have call predecessors, (674), 163 states have return successors, (811), 667 states have call predecessors, (811), 669 states have call successors, (811) [2025-01-09 03:48:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3804 states to 3804 states and 6460 transitions. [2025-01-09 03:48:17,283 INFO L78 Accepts]: Start accepts. Automaton has 3804 states and 6460 transitions. Word has length 119 [2025-01-09 03:48:17,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:17,284 INFO L471 AbstractCegarLoop]: Abstraction has 3804 states and 6460 transitions. [2025-01-09 03:48:17,284 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), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 03:48:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3804 states and 6460 transitions. [2025-01-09 03:48:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:48:17,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:17,286 INFO L218 NwaCegarLoop]: trace histogram [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:48:17,294 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:48:17,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:17,487 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:17,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:17,488 INFO L85 PathProgramCache]: Analyzing trace with hash -769404032, now seen corresponding path program 1 times [2025-01-09 03:48:17,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:17,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764341655] [2025-01-09 03:48:17,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:17,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:17,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:48:17,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:48:17,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:17,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:48:17,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:17,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764341655] [2025-01-09 03:48:17,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764341655] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:17,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032503339] [2025-01-09 03:48:17,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:17,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:17,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:17,613 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:48:17,615 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:48:17,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:48:17,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:48:17,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:17,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:17,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:17,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:17,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:17,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032503339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:17,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:17,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:48:17,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344831384] [2025-01-09 03:48:17,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:17,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:17,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:17,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:17,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:17,911 INFO L87 Difference]: Start difference. First operand 3804 states and 6460 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 03:48:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:18,097 INFO L93 Difference]: Finished difference Result 11319 states and 19517 transitions. [2025-01-09 03:48:18,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:18,098 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 120 [2025-01-09 03:48:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:18,180 INFO L225 Difference]: With dead ends: 11319 [2025-01-09 03:48:18,180 INFO L226 Difference]: Without dead ends: 7560 [2025-01-09 03:48:18,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 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:48:18,195 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 829 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:18,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1735 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7560 states. [2025-01-09 03:48:18,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7560 to 7555. [2025-01-09 03:48:18,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7555 states, 5893 states have (on average 1.6794501951467844) internal successors, (9897), 6122 states have internal predecessors, (9897), 1338 states have call successors, (1338), 309 states have call predecessors, (1338), 323 states have return successors, (1795), 1331 states have call predecessors, (1795), 1333 states have call successors, (1795) [2025-01-09 03:48:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 13030 transitions. [2025-01-09 03:48:18,507 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 13030 transitions. Word has length 120 [2025-01-09 03:48:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:18,507 INFO L471 AbstractCegarLoop]: Abstraction has 7555 states and 13030 transitions. [2025-01-09 03:48:18,507 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 03:48:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 13030 transitions. [2025-01-09 03:48:18,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:48:18,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:18,510 INFO L218 NwaCegarLoop]: trace histogram [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:48:18,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:48:18,715 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,SelfDestructingSolverStorable17 [2025-01-09 03:48:18,715 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:18,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:18,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1918159576, now seen corresponding path program 1 times [2025-01-09 03:48:18,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:18,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947731347] [2025-01-09 03:48:18,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:18,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:48:18,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:48:18,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:18,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:48:18,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:18,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947731347] [2025-01-09 03:48:18,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947731347] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:18,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161512653] [2025-01-09 03:48:18,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:18,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:18,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:18,841 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:48:18,842 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:48:18,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:48:19,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:48:19,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:19,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:19,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:19,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:19,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:48:19,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:19,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161512653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:19,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:19,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 03:48:19,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922070683] [2025-01-09 03:48:19,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:19,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:19,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:19,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:19,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:19,115 INFO L87 Difference]: Start difference. First operand 7555 states and 13030 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 03:48:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:19,436 INFO L93 Difference]: Finished difference Result 22574 states and 39853 transitions. [2025-01-09 03:48:19,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:19,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 121 [2025-01-09 03:48:19,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:19,535 INFO L225 Difference]: With dead ends: 22574 [2025-01-09 03:48:19,536 INFO L226 Difference]: Without dead ends: 15056 [2025-01-09 03:48:19,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 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:48:19,573 INFO L435 NwaCegarLoop]: 957 mSDtfsCounter, 828 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:19,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1756 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15056 states. [2025-01-09 03:48:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15056 to 15050. [2025-01-09 03:48:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15050 states, 11741 states have (on average 1.6796695341112342) internal successors, (19721), 12194 states have internal predecessors, (19721), 2666 states have call successors, (2666), 613 states have call predecessors, (2666), 642 states have return successors, (4194), 2658 states have call predecessors, (4194), 2661 states have call successors, (4194) [2025-01-09 03:48:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15050 states to 15050 states and 26581 transitions. [2025-01-09 03:48:20,161 INFO L78 Accepts]: Start accepts. Automaton has 15050 states and 26581 transitions. Word has length 121 [2025-01-09 03:48:20,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:20,162 INFO L471 AbstractCegarLoop]: Abstraction has 15050 states and 26581 transitions. [2025-01-09 03:48:20,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 03:48:20,163 INFO L276 IsEmpty]: Start isEmpty. Operand 15050 states and 26581 transitions. [2025-01-09 03:48:20,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-09 03:48:20,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:20,184 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:20,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:48:20,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:20,385 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:20,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:20,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1919775961, now seen corresponding path program 1 times [2025-01-09 03:48:20,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:20,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341643443] [2025-01-09 03:48:20,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:20,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:20,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-09 03:48:20,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-09 03:48:20,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:20,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 03:48:20,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:20,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341643443] [2025-01-09 03:48:20,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341643443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:20,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:20,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:20,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115608000] [2025-01-09 03:48:20,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:20,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:20,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:20,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:20,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:20,538 INFO L87 Difference]: Start difference. First operand 15050 states and 26581 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:48:21,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:21,380 INFO L93 Difference]: Finished difference Result 30183 states and 54936 transitions. [2025-01-09 03:48:21,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:21,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 189 [2025-01-09 03:48:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:21,469 INFO L225 Difference]: With dead ends: 30183 [2025-01-09 03:48:21,470 INFO L226 Difference]: Without dead ends: 15178 [2025-01-09 03:48:21,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:21,529 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 842 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:21,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 3107 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:48:21,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15178 states. [2025-01-09 03:48:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15178 to 15178. [2025-01-09 03:48:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15178 states, 11837 states have (on average 1.6741573033707866) internal successors, (19817), 12290 states have internal predecessors, (19817), 2666 states have call successors, (2666), 645 states have call predecessors, (2666), 674 states have return successors, (4226), 2658 states have call predecessors, (4226), 2661 states have call successors, (4226) [2025-01-09 03:48:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15178 states to 15178 states and 26709 transitions. [2025-01-09 03:48:22,200 INFO L78 Accepts]: Start accepts. Automaton has 15178 states and 26709 transitions. Word has length 189 [2025-01-09 03:48:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:22,200 INFO L471 AbstractCegarLoop]: Abstraction has 15178 states and 26709 transitions. [2025-01-09 03:48:22,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:48:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 15178 states and 26709 transitions. [2025-01-09 03:48:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 03:48:22,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:22,217 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:22,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:48:22,218 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:22,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:22,218 INFO L85 PathProgramCache]: Analyzing trace with hash 927531958, now seen corresponding path program 1 times [2025-01-09 03:48:22,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:22,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219873301] [2025-01-09 03:48:22,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:22,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:22,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 03:48:22,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 03:48:22,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:22,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 03:48:22,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:22,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219873301] [2025-01-09 03:48:22,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219873301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:22,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:22,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:22,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382891926] [2025-01-09 03:48:22,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:22,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:22,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:22,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:22,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:22,327 INFO L87 Difference]: Start difference. First operand 15178 states and 26709 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:48:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:23,114 INFO L93 Difference]: Finished difference Result 30471 states and 55160 transitions. [2025-01-09 03:48:23,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:23,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 190 [2025-01-09 03:48:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:23,236 INFO L225 Difference]: With dead ends: 30471 [2025-01-09 03:48:23,236 INFO L226 Difference]: Without dead ends: 15338 [2025-01-09 03:48:23,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:23,328 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 841 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 3113 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:23,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 3113 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:48:23,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15338 states. [2025-01-09 03:48:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15338 to 15338. [2025-01-09 03:48:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15338 states, 11965 states have (on average 1.6669452569995822) internal successors, (19945), 12418 states have internal predecessors, (19945), 2666 states have call successors, (2666), 677 states have call predecessors, (2666), 706 states have return successors, (4258), 2658 states have call predecessors, (4258), 2661 states have call successors, (4258) [2025-01-09 03:48:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15338 states to 15338 states and 26869 transitions. [2025-01-09 03:48:23,993 INFO L78 Accepts]: Start accepts. Automaton has 15338 states and 26869 transitions. Word has length 190 [2025-01-09 03:48:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:23,994 INFO L471 AbstractCegarLoop]: Abstraction has 15338 states and 26869 transitions. [2025-01-09 03:48:23,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:48:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand 15338 states and 26869 transitions. [2025-01-09 03:48:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 03:48:24,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:24,012 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:24,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:48:24,012 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:24,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:24,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2081094781, now seen corresponding path program 1 times [2025-01-09 03:48:24,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:24,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971690487] [2025-01-09 03:48:24,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:24,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:24,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 03:48:24,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 03:48:24,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:24,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 03:48:24,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:24,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971690487] [2025-01-09 03:48:24,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971690487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:24,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:24,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:24,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748240132] [2025-01-09 03:48:24,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:24,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:24,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:24,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:24,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:24,156 INFO L87 Difference]: Start difference. First operand 15338 states and 26869 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:48:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:24,845 INFO L93 Difference]: Finished difference Result 30823 states and 55448 transitions. [2025-01-09 03:48:24,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:24,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 191 [2025-01-09 03:48:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:24,946 INFO L225 Difference]: With dead ends: 30823 [2025-01-09 03:48:24,947 INFO L226 Difference]: Without dead ends: 15530 [2025-01-09 03:48:25,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:25,029 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 841 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 3113 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:25,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 3113 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:48:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15530 states. [2025-01-09 03:48:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15530 to 15530. [2025-01-09 03:48:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15530 states, 12125 states have (on average 1.6581443298969072) internal successors, (20105), 12578 states have internal predecessors, (20105), 2666 states have call successors, (2666), 709 states have call predecessors, (2666), 738 states have return successors, (4290), 2658 states have call predecessors, (4290), 2661 states have call successors, (4290) [2025-01-09 03:48:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15530 states to 15530 states and 27061 transitions. [2025-01-09 03:48:25,554 INFO L78 Accepts]: Start accepts. Automaton has 15530 states and 27061 transitions. Word has length 191 [2025-01-09 03:48:25,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:25,554 INFO L471 AbstractCegarLoop]: Abstraction has 15530 states and 27061 transitions. [2025-01-09 03:48:25,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:48:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 15530 states and 27061 transitions. [2025-01-09 03:48:25,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 03:48:25,568 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:25,569 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:25,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:48:25,569 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:25,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:25,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1940102190, now seen corresponding path program 1 times [2025-01-09 03:48:25,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:25,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384141021] [2025-01-09 03:48:25,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:25,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:25,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 03:48:25,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 03:48:25,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:25,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 03:48:25,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:25,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384141021] [2025-01-09 03:48:25,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384141021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:25,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:25,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:25,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203778223] [2025-01-09 03:48:25,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:25,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:25,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:25,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:25,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:25,686 INFO L87 Difference]: Start difference. First operand 15530 states and 27061 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:48:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:26,285 INFO L93 Difference]: Finished difference Result 31239 states and 55800 transitions. [2025-01-09 03:48:26,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:26,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 192 [2025-01-09 03:48:26,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:26,389 INFO L225 Difference]: With dead ends: 31239 [2025-01-09 03:48:26,389 INFO L226 Difference]: Without dead ends: 15754 [2025-01-09 03:48:26,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:26,457 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 841 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 3113 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:26,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 3113 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:48:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2025-01-09 03:48:26,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15754. [2025-01-09 03:48:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15754 states, 12317 states have (on average 1.6478850369408136) internal successors, (20297), 12770 states have internal predecessors, (20297), 2666 states have call successors, (2666), 741 states have call predecessors, (2666), 770 states have return successors, (4322), 2658 states have call predecessors, (4322), 2661 states have call successors, (4322) [2025-01-09 03:48:26,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15754 states to 15754 states and 27285 transitions. [2025-01-09 03:48:27,008 INFO L78 Accepts]: Start accepts. Automaton has 15754 states and 27285 transitions. Word has length 192 [2025-01-09 03:48:27,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:27,010 INFO L471 AbstractCegarLoop]: Abstraction has 15754 states and 27285 transitions. [2025-01-09 03:48:27,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:48:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 15754 states and 27285 transitions. [2025-01-09 03:48:27,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 03:48:27,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:27,019 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:27,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:48:27,019 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:27,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:27,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1349809119, now seen corresponding path program 1 times [2025-01-09 03:48:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:27,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806227251] [2025-01-09 03:48:27,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:27,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:27,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 03:48:27,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 03:48:27,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:27,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 03:48:27,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:27,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806227251] [2025-01-09 03:48:27,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806227251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:27,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:27,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 03:48:27,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415474804] [2025-01-09 03:48:27,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:27,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:48:27,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:27,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:48:27,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:48:27,249 INFO L87 Difference]: Start difference. First operand 15754 states and 27285 transitions. Second operand has 10 states, 10 states have (on average 12.1) internal successors, (121), 8 states have internal predecessors, (121), 5 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (23), 7 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 03:48:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:33,437 INFO L93 Difference]: Finished difference Result 70182 states and 133698 transitions. [2025-01-09 03:48:33,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 03:48:33,438 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 8 states have internal predecessors, (121), 5 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (23), 7 states have call predecessors, (23), 4 states have call successors, (23) Word has length 193 [2025-01-09 03:48:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:33,876 INFO L225 Difference]: With dead ends: 70182 [2025-01-09 03:48:33,877 INFO L226 Difference]: Without dead ends: 54473 [2025-01-09 03:48:34,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-01-09 03:48:34,014 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 2593 mSDsluCounter, 4339 mSDsCounter, 0 mSdLazyCounter, 10412 mSolverCounterSat, 618 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2703 SdHoareTripleChecker+Valid, 5205 SdHoareTripleChecker+Invalid, 11030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 618 IncrementalHoareTripleChecker+Valid, 10412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:34,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2703 Valid, 5205 Invalid, 11030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [618 Valid, 10412 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-09 03:48:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54473 states. [2025-01-09 03:48:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54473 to 53168. [2025-01-09 03:48:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53168 states, 40448 states have (on average 1.6306121439873418) internal successors, (65955), 42181 states have internal predecessors, (65955), 10124 states have call successors, (10124), 2214 states have call predecessors, (10124), 2595 states have return successors, (23234), 10340 states have call predecessors, (23234), 10119 states have call successors, (23234) [2025-01-09 03:48:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53168 states to 53168 states and 99313 transitions. [2025-01-09 03:48:36,283 INFO L78 Accepts]: Start accepts. Automaton has 53168 states and 99313 transitions. Word has length 193 [2025-01-09 03:48:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:36,283 INFO L471 AbstractCegarLoop]: Abstraction has 53168 states and 99313 transitions. [2025-01-09 03:48:36,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 8 states have internal predecessors, (121), 5 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (23), 7 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 03:48:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 53168 states and 99313 transitions. [2025-01-09 03:48:36,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 03:48:36,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:36,338 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:36,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 03:48:36,338 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:36,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:36,338 INFO L85 PathProgramCache]: Analyzing trace with hash 305954404, now seen corresponding path program 1 times [2025-01-09 03:48:36,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:36,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129688711] [2025-01-09 03:48:36,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:36,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:36,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 03:48:36,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 03:48:36,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:36,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 03:48:36,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:36,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129688711] [2025-01-09 03:48:36,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129688711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:36,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:36,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:48:36,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049464212] [2025-01-09 03:48:36,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:36,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:48:36,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:36,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:48:36,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:36,484 INFO L87 Difference]: Start difference. First operand 53168 states and 99313 transitions. Second operand has 8 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:48:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:37,780 INFO L93 Difference]: Finished difference Result 68725 states and 126268 transitions. [2025-01-09 03:48:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:48:37,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 196 [2025-01-09 03:48:37,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:37,902 INFO L225 Difference]: With dead ends: 68725 [2025-01-09 03:48:37,902 INFO L226 Difference]: Without dead ends: 15591 [2025-01-09 03:48:38,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:38,343 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 8 mSDsluCounter, 4945 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 5773 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:38,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 5773 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:38,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15591 states. [2025-01-09 03:48:38,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15591 to 15591. [2025-01-09 03:48:38,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15591 states, 12218 states have (on average 1.647569160255361) internal successors, (20130), 12671 states have internal predecessors, (20130), 2602 states have call successors, (2602), 741 states have call predecessors, (2602), 770 states have return successors, (4258), 2594 states have call predecessors, (4258), 2597 states have call successors, (4258) [2025-01-09 03:48:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15591 states to 15591 states and 26990 transitions. [2025-01-09 03:48:38,917 INFO L78 Accepts]: Start accepts. Automaton has 15591 states and 26990 transitions. Word has length 196 [2025-01-09 03:48:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:38,918 INFO L471 AbstractCegarLoop]: Abstraction has 15591 states and 26990 transitions. [2025-01-09 03:48:38,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:48:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 15591 states and 26990 transitions. [2025-01-09 03:48:38,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 03:48:38,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:38,928 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:38,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 03:48:38,928 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:38,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:38,929 INFO L85 PathProgramCache]: Analyzing trace with hash 613880480, now seen corresponding path program 1 times [2025-01-09 03:48:38,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:38,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695066379] [2025-01-09 03:48:38,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:38,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:38,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 03:48:38,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 03:48:38,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:38,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 03:48:39,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:39,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695066379] [2025-01-09 03:48:39,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695066379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:39,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:39,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:48:39,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127979450] [2025-01-09 03:48:39,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:39,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:48:39,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:39,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:48:39,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:39,212 INFO L87 Difference]: Start difference. First operand 15591 states and 26990 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 5 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (24), 6 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 03:48:40,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:40,972 INFO L93 Difference]: Finished difference Result 31268 states and 55281 transitions. [2025-01-09 03:48:40,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:48:40,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 5 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (24), 6 states have call predecessors, (24), 4 states have call successors, (24) Word has length 199 [2025-01-09 03:48:40,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:41,053 INFO L225 Difference]: With dead ends: 31268 [2025-01-09 03:48:41,053 INFO L226 Difference]: Without dead ends: 15719 [2025-01-09 03:48:41,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:48:41,104 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 1274 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 3309 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 3652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 3309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:41,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 1725 Invalid, 3652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 3309 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 03:48:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15719 states. [2025-01-09 03:48:41,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15719 to 15719. [2025-01-09 03:48:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15719 states, 12314 states have (on average 1.6425207081370798) internal successors, (20226), 12767 states have internal predecessors, (20226), 2602 states have call successors, (2602), 741 states have call predecessors, (2602), 802 states have return successors, (4418), 2626 states have call predecessors, (4418), 2597 states have call successors, (4418) [2025-01-09 03:48:41,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15719 states to 15719 states and 27246 transitions. [2025-01-09 03:48:41,556 INFO L78 Accepts]: Start accepts. Automaton has 15719 states and 27246 transitions. Word has length 199 [2025-01-09 03:48:41,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:41,556 INFO L471 AbstractCegarLoop]: Abstraction has 15719 states and 27246 transitions. [2025-01-09 03:48:41,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 5 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (24), 6 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 03:48:41,557 INFO L276 IsEmpty]: Start isEmpty. Operand 15719 states and 27246 transitions. [2025-01-09 03:48:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 03:48:41,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:41,565 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:41,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 03:48:41,565 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:41,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:41,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1451301729, now seen corresponding path program 1 times [2025-01-09 03:48:41,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:41,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199605526] [2025-01-09 03:48:41,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:41,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:41,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 03:48:41,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 03:48:41,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:41,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 03:48:41,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:41,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199605526] [2025-01-09 03:48:41,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199605526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:41,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:41,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:48:41,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108419284] [2025-01-09 03:48:41,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:41,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:48:41,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:41,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:48:41,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:41,699 INFO L87 Difference]: Start difference. First operand 15719 states and 27246 transitions. Second operand has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 5 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (24), 6 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 03:48:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:45,908 INFO L93 Difference]: Finished difference Result 61823 states and 111547 transitions. [2025-01-09 03:48:45,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 03:48:45,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 5 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (24), 6 states have call predecessors, (24), 4 states have call successors, (24) Word has length 200 [2025-01-09 03:48:45,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:46,199 INFO L225 Difference]: With dead ends: 61823 [2025-01-09 03:48:46,200 INFO L226 Difference]: Without dead ends: 46146 [2025-01-09 03:48:46,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-01-09 03:48:46,295 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 3414 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 4989 mSolverCounterSat, 911 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3486 SdHoareTripleChecker+Valid, 2201 SdHoareTripleChecker+Invalid, 5900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 911 IncrementalHoareTripleChecker+Valid, 4989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:46,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3486 Valid, 2201 Invalid, 5900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [911 Valid, 4989 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 03:48:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46146 states. [2025-01-09 03:48:48,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46146 to 45742. [2025-01-09 03:48:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45742 states, 35748 states have (on average 1.6124538435716684) internal successors, (57642), 37096 states have internal predecessors, (57642), 7592 states have call successors, (7592), 2309 states have call predecessors, (7592), 2401 states have return successors, (15136), 7489 states have call predecessors, (15136), 7587 states have call successors, (15136) [2025-01-09 03:48:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45742 states to 45742 states and 80370 transitions. [2025-01-09 03:48:48,688 INFO L78 Accepts]: Start accepts. Automaton has 45742 states and 80370 transitions. Word has length 200 [2025-01-09 03:48:48,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:48,689 INFO L471 AbstractCegarLoop]: Abstraction has 45742 states and 80370 transitions. [2025-01-09 03:48:48,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 5 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (24), 6 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 03:48:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 45742 states and 80370 transitions. [2025-01-09 03:48:48,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 03:48:48,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:48,873 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:48,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 03:48:48,873 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:48,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:48,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1149084481, now seen corresponding path program 1 times [2025-01-09 03:48:48,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:48,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091319904] [2025-01-09 03:48:48,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:48,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:48,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 03:48:48,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 03:48:48,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:48,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-01-09 03:48:49,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:49,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091319904] [2025-01-09 03:48:49,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091319904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:49,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:49,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:48:49,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326737473] [2025-01-09 03:48:49,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:49,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:48:49,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:49,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:48:49,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:49,052 INFO L87 Difference]: Start difference. First operand 45742 states and 80370 transitions. Second operand has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 5 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 03:48:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:57,143 INFO L93 Difference]: Finished difference Result 165043 states and 341718 transitions. [2025-01-09 03:48:57,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:48:57,144 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 5 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) Word has length 202 [2025-01-09 03:48:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:58,494 INFO L225 Difference]: With dead ends: 165043 [2025-01-09 03:48:58,494 INFO L226 Difference]: Without dead ends: 119343 [2025-01-09 03:48:58,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:48:58,842 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 3245 mSDsluCounter, 2390 mSDsCounter, 0 mSdLazyCounter, 6193 mSolverCounterSat, 938 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3279 SdHoareTripleChecker+Valid, 3207 SdHoareTripleChecker+Invalid, 7131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 938 IncrementalHoareTripleChecker+Valid, 6193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:58,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3279 Valid, 3207 Invalid, 7131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [938 Valid, 6193 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 03:48:58,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119343 states.