./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product29.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product29.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9d4bfafe2ee2b10c7451875462462bdbc63aaee25e1868c3faa4756fb5ebfc5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:35:30,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:35:30,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:35:30,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:35:30,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:35:30,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:35:30,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:35:30,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:35:30,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:35:30,906 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:35:30,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:35:30,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:35:30,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:35:30,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:35:30,906 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:35:30,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:35:30,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:35:30,907 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:35:30,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:35:30,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:35:30,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:35:30,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:35:30,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:35:30,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:35:30,907 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:35:30,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:35:30,907 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:35:30,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:35:30,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:35:30,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:35:30,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:35:30,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:35:30,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:35:30,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:35:30,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:35:30,908 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:35:30,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:35:30,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:35:30,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:35:30,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:35:30,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:35:30,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:35:30,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:35:30,909 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/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 -> a9d4bfafe2ee2b10c7451875462462bdbc63aaee25e1868c3faa4756fb5ebfc5 [2025-03-16 18:35:31,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:35:31,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:35:31,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:35:31,160 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:35:31,161 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:35:31,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product29.cil.c [2025-03-16 18:35:32,342 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2f66259e/808b21a1a74e4b8dbe2f84df8430b377/FLAGfad6456a8 [2025-03-16 18:35:32,637 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:35:32,638 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product29.cil.c [2025-03-16 18:35:32,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2f66259e/808b21a1a74e4b8dbe2f84df8430b377/FLAGfad6456a8 [2025-03-16 18:35:32,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2f66259e/808b21a1a74e4b8dbe2f84df8430b377 [2025-03-16 18:35:32,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:35:32,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:35:32,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:35:32,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:35:32,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:35:32,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:35:32" (1/1) ... [2025-03-16 18:35:32,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3249ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:32, skipping insertion in model container [2025-03-16 18:35:32,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:35:32" (1/1) ... [2025-03-16 18:35:32,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:35:32,925 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product29.cil.c[17414,17427] [2025-03-16 18:35:33,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:35:33,167 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:35:33,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2025-03-16 18:35:33,174 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [716] [2025-03-16 18:35:33,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [725] [2025-03-16 18:35:33,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [739] [2025-03-16 18:35:33,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2285] [2025-03-16 18:35:33,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2651] [2025-03-16 18:35:33,176 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3008] [2025-03-16 18:35:33,176 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3126] [2025-03-16 18:35:33,176 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [3217] [2025-03-16 18:35:33,176 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3398] [2025-03-16 18:35:33,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product29.cil.c[17414,17427] [2025-03-16 18:35:33,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:35:33,292 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:35:33,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:33 WrapperNode [2025-03-16 18:35:33,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:35:33,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:35:33,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:35:33,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:35:33,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:33" (1/1) ... [2025-03-16 18:35:33,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:33" (1/1) ... [2025-03-16 18:35:33,364 INFO L138 Inliner]: procedures = 93, calls = 341, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 901 [2025-03-16 18:35:33,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:35:33,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:35:33,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:35:33,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:35:33,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:33" (1/1) ... [2025-03-16 18:35:33,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:33" (1/1) ... [2025-03-16 18:35:33,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:33" (1/1) ... [2025-03-16 18:35:33,398 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-16 18:35:33,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:33" (1/1) ... [2025-03-16 18:35:33,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:33" (1/1) ... [2025-03-16 18:35:33,422 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:33" (1/1) ... [2025-03-16 18:35:33,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:33" (1/1) ... [2025-03-16 18:35:33,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:33" (1/1) ... [2025-03-16 18:35:33,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:33" (1/1) ... [2025-03-16 18:35:33,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:35:33,448 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:35:33,449 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:35:33,449 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:35:33,449 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:33" (1/1) ... [2025-03-16 18:35:33,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:35:33,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:35:33,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 18:35:33,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 18:35:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:35:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-16 18:35:33,496 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-16 18:35:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-16 18:35:33,496 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-16 18:35:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-16 18:35:33,496 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-16 18:35:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-16 18:35:33,497 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-16 18:35:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-16 18:35:33,497 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-16 18:35:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-03-16 18:35:33,497 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-03-16 18:35:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-16 18:35:33,497 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-16 18:35:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-16 18:35:33,497 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-16 18:35:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-16 18:35:33,497 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-16 18:35:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-16 18:35:33,497 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-16 18:35:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-16 18:35:33,498 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-16 18:35:33,498 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-16 18:35:33,498 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-16 18:35:33,498 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-16 18:35:33,498 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-16 18:35:33,498 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-16 18:35:33,498 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-16 18:35:33,498 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-16 18:35:33,498 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-16 18:35:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-16 18:35:33,499 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-16 18:35:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-16 18:35:33,499 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-16 18:35:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-16 18:35:33,499 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-16 18:35:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-16 18:35:33,499 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-16 18:35:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:35:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 18:35:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 18:35:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 18:35:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 18:35:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 18:35:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 18:35:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 18:35:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 18:35:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 18:35:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 18:35:33,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 18:35:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 18:35:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 18:35:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 18:35:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 18:35:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-16 18:35:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-16 18:35:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-16 18:35:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-16 18:35:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-16 18:35:33,500 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-16 18:35:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-16 18:35:33,500 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-16 18:35:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-16 18:35:33,500 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-16 18:35:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-16 18:35:33,500 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-16 18:35:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:35:33,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:35:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-16 18:35:33,500 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-16 18:35:33,656 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:35:33,658 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:35:33,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3123: #res := ~retValue_acc~25; [2025-03-16 18:35:33,742 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3045: #res := ~retValue_acc~23; [2025-03-16 18:35:33,745 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L823: #res := ~retValue_acc~3; [2025-03-16 18:35:33,760 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1001: #res := ~retValue_acc~4; [2025-03-16 18:35:33,962 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1611-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~13#1; [2025-03-16 18:35:33,962 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1577: #res#1 := ~retValue_acc~12#1; [2025-03-16 18:35:34,034 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1709: #res := ~retValue_acc~16; [2025-03-16 18:35:34,050 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3084: #res := ~retValue_acc~24; [2025-03-16 18:35:34,170 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1538: #res := ~retValue_acc~11; [2025-03-16 18:35:34,179 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1044: #res := ~retValue_acc~6; [2025-03-16 18:35:34,230 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-1: isEmpty_#res#1 := isEmpty_~retValue_acc~8#1; [2025-03-16 18:35:34,333 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1695-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~15#1; [2025-03-16 18:35:34,334 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1667-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~14#1; [2025-03-16 18:35:34,391 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1173-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~9#1; [2025-03-16 18:35:34,391 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1186-1: isIdle_#res#1 := isIdle_~retValue_acc~10#1; [2025-03-16 18:35:34,434 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L402: #res := ~retValue_acc~1; [2025-03-16 18:35:34,489 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3430-1: valid_product_#res#1 := valid_product_~retValue_acc~27#1; [2025-03-16 18:35:34,489 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3005-1: main_#res#1 := main_~retValue_acc~22#1; [2025-03-16 18:35:34,498 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: #res := ~retValue_acc~0; [2025-03-16 18:35:34,500 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1010: #res := ~retValue_acc~5; [2025-03-16 18:35:34,503 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: #res := ~retValue_acc~2; [2025-03-16 18:35:34,630 INFO L? ?]: Removed 459 outVars from TransFormulas that were not future-live. [2025-03-16 18:35:34,630 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:35:34,646 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:35:34,652 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:35:34,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:35:34 BoogieIcfgContainer [2025-03-16 18:35:34,653 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:35:34,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:35:34,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:35:34,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:35:34,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:35:32" (1/3) ... [2025-03-16 18:35:34,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5f741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:35:34, skipping insertion in model container [2025-03-16 18:35:34,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:33" (2/3) ... [2025-03-16 18:35:34,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5f741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:35:34, skipping insertion in model container [2025-03-16 18:35:34,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:35:34" (3/3) ... [2025-03-16 18:35:34,661 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product29.cil.c [2025-03-16 18:35:34,671 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:35:34,674 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product29.cil.c that has 25 procedures, 563 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 18:35:34,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:35:34,734 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;@49937e15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:35:34,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:35:34,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 563 states, 442 states have (on average 1.7081447963800904) internal successors, (755), 463 states have internal predecessors, (755), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-16 18:35:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 18:35:34,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:34,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:34,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:34,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:34,770 INFO L85 PathProgramCache]: Analyzing trace with hash -120242239, now seen corresponding path program 1 times [2025-03-16 18:35:34,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:34,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7619723] [2025-03-16 18:35:34,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:34,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:34,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 18:35:34,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 18:35:34,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:34,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:35,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:35,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7619723] [2025-03-16 18:35:35,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7619723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:35,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:35,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:35,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997631580] [2025-03-16 18:35:35,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:35,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:35,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:35,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:35,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:35,272 INFO L87 Difference]: Start difference. First operand has 563 states, 442 states have (on average 1.7081447963800904) internal successors, (755), 463 states have internal predecessors, (755), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:35,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:35,415 INFO L93 Difference]: Finished difference Result 1111 states and 1870 transitions. [2025-03-16 18:35:35,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:35,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 83 [2025-03-16 18:35:35,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:35,436 INFO L225 Difference]: With dead ends: 1111 [2025-03-16 18:35:35,436 INFO L226 Difference]: Without dead ends: 556 [2025-03-16 18:35:35,446 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-03-16 18:35:35,450 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 5 mSDsluCounter, 1846 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2771 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-03-16 18:35:35,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2771 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:35,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-16 18:35:35,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-16 18:35:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 437 states have (on average 1.7048054919908466) internal successors, (745), 456 states have internal predecessors, (745), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:35:35,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 930 transitions. [2025-03-16 18:35:35,518 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 930 transitions. Word has length 83 [2025-03-16 18:35:35,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:35,519 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 930 transitions. [2025-03-16 18:35:35,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:35,519 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 930 transitions. [2025-03-16 18:35:35,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 18:35:35,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:35,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:35,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:35:35,526 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:35,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:35,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1795043368, now seen corresponding path program 1 times [2025-03-16 18:35:35,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:35,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183938289] [2025-03-16 18:35:35,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:35,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:35,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 18:35:35,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 18:35:35,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:35,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:35,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:35,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183938289] [2025-03-16 18:35:35,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183938289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:35,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:35,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:35,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124840041] [2025-03-16 18:35:35,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:35,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:35,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:35,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:35,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:35,716 INFO L87 Difference]: Start difference. First operand 556 states and 930 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:35,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:35,793 INFO L93 Difference]: Finished difference Result 1099 states and 1842 transitions. [2025-03-16 18:35:35,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:35,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 85 [2025-03-16 18:35:35,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:35,802 INFO L225 Difference]: With dead ends: 1099 [2025-03-16 18:35:35,802 INFO L226 Difference]: Without dead ends: 556 [2025-03-16 18:35:35,805 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-03-16 18:35:35,806 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 4 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2753 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-03-16 18:35:35,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2753 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:35,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-16 18:35:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-16 18:35:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 437 states have (on average 1.702517162471396) internal successors, (744), 456 states have internal predecessors, (744), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:35:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 929 transitions. [2025-03-16 18:35:35,846 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 929 transitions. Word has length 85 [2025-03-16 18:35:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:35,846 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 929 transitions. [2025-03-16 18:35:35,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:35,847 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 929 transitions. [2025-03-16 18:35:35,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 18:35:35,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:35,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:35,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:35:35,854 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:35,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:35,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1125810420, now seen corresponding path program 1 times [2025-03-16 18:35:35,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:35,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804799128] [2025-03-16 18:35:35,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:35,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:35,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 18:35:35,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 18:35:35,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:35,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:36,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:36,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804799128] [2025-03-16 18:35:36,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804799128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:36,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:36,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:36,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828319150] [2025-03-16 18:35:36,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:36,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:36,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:36,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:36,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:36,049 INFO L87 Difference]: Start difference. First operand 556 states and 929 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:36,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:36,114 INFO L93 Difference]: Finished difference Result 1099 states and 1841 transitions. [2025-03-16 18:35:36,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:36,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2025-03-16 18:35:36,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:36,122 INFO L225 Difference]: With dead ends: 1099 [2025-03-16 18:35:36,123 INFO L226 Difference]: Without dead ends: 556 [2025-03-16 18:35:36,126 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-03-16 18:35:36,127 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 3 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2753 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-03-16 18:35:36,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2753 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:36,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-16 18:35:36,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-16 18:35:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 437 states have (on average 1.700228832951945) internal successors, (743), 456 states have internal predecessors, (743), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:35:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 928 transitions. [2025-03-16 18:35:36,158 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 928 transitions. Word has length 86 [2025-03-16 18:35:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:36,159 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 928 transitions. [2025-03-16 18:35:36,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 928 transitions. [2025-03-16 18:35:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 18:35:36,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:36,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:36,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 18:35:36,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:36,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:36,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1991501803, now seen corresponding path program 1 times [2025-03-16 18:35:36,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:36,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36645896] [2025-03-16 18:35:36,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:36,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 18:35:36,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 18:35:36,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:36,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:36,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:36,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36645896] [2025-03-16 18:35:36,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36645896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:36,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:36,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:36,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698774977] [2025-03-16 18:35:36,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:36,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:36,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:36,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:36,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:36,309 INFO L87 Difference]: Start difference. First operand 556 states and 928 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:36,352 INFO L93 Difference]: Finished difference Result 1099 states and 1840 transitions. [2025-03-16 18:35:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:36,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 87 [2025-03-16 18:35:36,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:36,356 INFO L225 Difference]: With dead ends: 1099 [2025-03-16 18:35:36,357 INFO L226 Difference]: Without dead ends: 556 [2025-03-16 18:35:36,359 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-03-16 18:35:36,359 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 2 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2753 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-03-16 18:35:36,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2753 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-16 18:35:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-16 18:35:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 437 states have (on average 1.6979405034324944) internal successors, (742), 456 states have internal predecessors, (742), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:35:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 927 transitions. [2025-03-16 18:35:36,379 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 927 transitions. Word has length 87 [2025-03-16 18:35:36,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:36,380 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 927 transitions. [2025-03-16 18:35:36,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 927 transitions. [2025-03-16 18:35:36,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 18:35:36,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:36,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:36,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 18:35:36,386 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:36,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:36,386 INFO L85 PathProgramCache]: Analyzing trace with hash -981567953, now seen corresponding path program 1 times [2025-03-16 18:35:36,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:36,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185895859] [2025-03-16 18:35:36,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:36,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:36,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 18:35:36,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 18:35:36,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:36,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:36,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:36,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185895859] [2025-03-16 18:35:36,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185895859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:36,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:36,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414802895] [2025-03-16 18:35:36,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:36,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:36,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:36,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:36,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:36,522 INFO L87 Difference]: Start difference. First operand 556 states and 927 transitions. 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, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:36,557 INFO L93 Difference]: Finished difference Result 1099 states and 1839 transitions. [2025-03-16 18:35:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:36,558 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, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2025-03-16 18:35:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:36,561 INFO L225 Difference]: With dead ends: 1099 [2025-03-16 18:35:36,561 INFO L226 Difference]: Without dead ends: 556 [2025-03-16 18:35:36,563 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-03-16 18:35:36,564 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 1 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2753 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-03-16 18:35:36,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2753 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-16 18:35:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-16 18:35:36,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 437 states have (on average 1.6956521739130435) internal successors, (741), 456 states have internal predecessors, (741), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:35:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 926 transitions. [2025-03-16 18:35:36,585 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 926 transitions. Word has length 88 [2025-03-16 18:35:36,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:36,585 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 926 transitions. [2025-03-16 18:35:36,585 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, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 926 transitions. [2025-03-16 18:35:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 18:35:36,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:36,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:36,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 18:35:36,588 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:36,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:36,588 INFO L85 PathProgramCache]: Analyzing trace with hash 517049262, now seen corresponding path program 1 times [2025-03-16 18:35:36,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:36,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444326215] [2025-03-16 18:35:36,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:36,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:36,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 18:35:36,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 18:35:36,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:36,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:36,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:36,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444326215] [2025-03-16 18:35:36,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444326215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:36,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:36,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:35:36,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395529781] [2025-03-16 18:35:36,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:36,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:35:36,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:36,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:35:36,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:35:36,774 INFO L87 Difference]: Start difference. First operand 556 states and 926 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:35:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:36,855 INFO L93 Difference]: Finished difference Result 1065 states and 1771 transitions. [2025-03-16 18:35:36,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:35:36,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2025-03-16 18:35:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:36,860 INFO L225 Difference]: With dead ends: 1065 [2025-03-16 18:35:36,860 INFO L226 Difference]: Without dead ends: 571 [2025-03-16 18:35:36,862 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-03-16 18:35:36,862 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 91 mSDsluCounter, 4499 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5415 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-03-16 18:35:36,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5415 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:36,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-16 18:35:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2025-03-16 18:35:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 447 states have (on average 1.691275167785235) internal successors, (756), 468 states have internal predecessors, (756), 96 states have call successors, (96), 24 states have call predecessors, (96), 25 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2025-03-16 18:35:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 945 transitions. [2025-03-16 18:35:36,884 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 945 transitions. Word has length 89 [2025-03-16 18:35:36,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:36,884 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 945 transitions. [2025-03-16 18:35:36,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:35:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 945 transitions. [2025-03-16 18:35:36,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 18:35:36,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:36,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:36,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 18:35:36,888 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:36,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:36,890 INFO L85 PathProgramCache]: Analyzing trace with hash 530582063, now seen corresponding path program 1 times [2025-03-16 18:35:36,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:36,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095536070] [2025-03-16 18:35:36,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:36,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:36,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 18:35:36,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 18:35:36,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:36,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:36,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:36,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095536070] [2025-03-16 18:35:36,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095536070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:36,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:36,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:36,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576892138] [2025-03-16 18:35:36,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:36,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:36,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:36,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:36,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:36,970 INFO L87 Difference]: Start difference. First operand 569 states and 945 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:37,008 INFO L93 Difference]: Finished difference Result 1117 states and 1865 transitions. [2025-03-16 18:35:37,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:37,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 89 [2025-03-16 18:35:37,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:37,014 INFO L225 Difference]: With dead ends: 1117 [2025-03-16 18:35:37,014 INFO L226 Difference]: Without dead ends: 550 [2025-03-16 18:35:37,016 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-03-16 18:35:37,017 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 0 mSDsluCounter, 1835 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2755 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-03-16 18:35:37,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2755 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-16 18:35:37,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2025-03-16 18:35:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 431 states have (on average 1.6867749419953597) internal successors, (727), 450 states have internal predecessors, (727), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:35:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 912 transitions. [2025-03-16 18:35:37,038 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 912 transitions. Word has length 89 [2025-03-16 18:35:37,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:37,038 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 912 transitions. [2025-03-16 18:35:37,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 912 transitions. [2025-03-16 18:35:37,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 18:35:37,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:37,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:37,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 18:35:37,041 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:37,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:37,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1438040891, now seen corresponding path program 1 times [2025-03-16 18:35:37,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:37,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047163157] [2025-03-16 18:35:37,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:37,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:37,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 18:35:37,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 18:35:37,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:37,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:37,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:37,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047163157] [2025-03-16 18:35:37,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047163157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:37,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:37,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:37,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240950939] [2025-03-16 18:35:37,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:37,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:37,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:37,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:37,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:37,169 INFO L87 Difference]: Start difference. First operand 550 states and 912 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:37,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:37,344 INFO L93 Difference]: Finished difference Result 1062 states and 1763 transitions. [2025-03-16 18:35:37,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:37,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 90 [2025-03-16 18:35:37,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:37,350 INFO L225 Difference]: With dead ends: 1062 [2025-03-16 18:35:37,350 INFO L226 Difference]: Without dead ends: 559 [2025-03-16 18:35:37,352 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-03-16 18:35:37,353 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 55 mSDsluCounter, 3447 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4316 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-03-16 18:35:37,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4316 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:35:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-16 18:35:37,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 550. [2025-03-16 18:35:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 431 states have (on average 1.677494199535963) internal successors, (723), 450 states have internal predecessors, (723), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:35:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 908 transitions. [2025-03-16 18:35:37,372 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 908 transitions. Word has length 90 [2025-03-16 18:35:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:37,372 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 908 transitions. [2025-03-16 18:35:37,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 908 transitions. [2025-03-16 18:35:37,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 18:35:37,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:37,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:37,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 18:35:37,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:37,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1979307863, now seen corresponding path program 1 times [2025-03-16 18:35:37,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:37,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552652942] [2025-03-16 18:35:37,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:37,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:37,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 18:35:37,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 18:35:37,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:37,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:37,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:37,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:37,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552652942] [2025-03-16 18:35:37,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552652942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:37,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:37,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:37,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573634789] [2025-03-16 18:35:37,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:37,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:37,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:37,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:37,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:37,555 INFO L87 Difference]: Start difference. First operand 550 states and 908 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:37,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:37,697 INFO L93 Difference]: Finished difference Result 1062 states and 1759 transitions. [2025-03-16 18:35:37,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:37,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 91 [2025-03-16 18:35:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:37,707 INFO L225 Difference]: With dead ends: 1062 [2025-03-16 18:35:37,707 INFO L226 Difference]: Without dead ends: 559 [2025-03-16 18:35:37,710 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-03-16 18:35:37,710 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 54 mSDsluCounter, 3447 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4316 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-03-16 18:35:37,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4316 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:35:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-16 18:35:37,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 550. [2025-03-16 18:35:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 431 states have (on average 1.668213457076566) internal successors, (719), 450 states have internal predecessors, (719), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:35:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 904 transitions. [2025-03-16 18:35:37,731 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 904 transitions. Word has length 91 [2025-03-16 18:35:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:37,732 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 904 transitions. [2025-03-16 18:35:37,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 904 transitions. [2025-03-16 18:35:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 18:35:37,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:37,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:37,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 18:35:37,735 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:37,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:37,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1830450910, now seen corresponding path program 1 times [2025-03-16 18:35:37,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:37,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065036529] [2025-03-16 18:35:37,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:37,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:37,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 18:35:37,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 18:35:37,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:37,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:37,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:37,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065036529] [2025-03-16 18:35:37,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065036529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:37,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:37,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:37,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221784844] [2025-03-16 18:35:37,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:37,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:37,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:37,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:37,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:37,847 INFO L87 Difference]: Start difference. First operand 550 states and 904 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:37,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:37,989 INFO L93 Difference]: Finished difference Result 1062 states and 1755 transitions. [2025-03-16 18:35:37,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:37,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2025-03-16 18:35:37,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:37,994 INFO L225 Difference]: With dead ends: 1062 [2025-03-16 18:35:37,995 INFO L226 Difference]: Without dead ends: 559 [2025-03-16 18:35:37,997 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-03-16 18:35:37,997 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 53 mSDsluCounter, 3430 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4298 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-03-16 18:35:37,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4298 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:35:37,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-16 18:35:38,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 550. [2025-03-16 18:35:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 431 states have (on average 1.6589327146171693) internal successors, (715), 450 states have internal predecessors, (715), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:35:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 900 transitions. [2025-03-16 18:35:38,017 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 900 transitions. Word has length 92 [2025-03-16 18:35:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:38,017 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 900 transitions. [2025-03-16 18:35:38,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:38,018 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 900 transitions. [2025-03-16 18:35:38,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 18:35:38,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:38,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:38,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 18:35:38,020 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:38,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:38,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1922789549, now seen corresponding path program 1 times [2025-03-16 18:35:38,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:38,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486485386] [2025-03-16 18:35:38,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:38,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:38,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 18:35:38,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 18:35:38,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:38,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:38,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:38,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486485386] [2025-03-16 18:35:38,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486485386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:38,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:38,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:35:38,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885892077] [2025-03-16 18:35:38,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:38,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:35:38,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:38,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:35:38,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:35:38,166 INFO L87 Difference]: Start difference. First operand 550 states and 900 transitions. Second operand has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:35:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:38,235 INFO L93 Difference]: Finished difference Result 1053 states and 1737 transitions. [2025-03-16 18:35:38,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:35:38,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2025-03-16 18:35:38,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:38,240 INFO L225 Difference]: With dead ends: 1053 [2025-03-16 18:35:38,240 INFO L226 Difference]: Without dead ends: 529 [2025-03-16 18:35:38,243 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-03-16 18:35:38,244 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 84 mSDsluCounter, 4372 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5261 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-03-16 18:35:38,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5261 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-16 18:35:38,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-03-16 18:35:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 410 states have (on average 1.6609756097560975) internal successors, (681), 429 states have internal predecessors, (681), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:35:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 866 transitions. [2025-03-16 18:35:38,262 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 866 transitions. Word has length 92 [2025-03-16 18:35:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:38,263 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 866 transitions. [2025-03-16 18:35:38,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:35:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 866 transitions. [2025-03-16 18:35:38,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 18:35:38,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:38,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:38,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 18:35:38,266 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:38,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:38,267 INFO L85 PathProgramCache]: Analyzing trace with hash -2047276332, now seen corresponding path program 1 times [2025-03-16 18:35:38,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:38,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224679403] [2025-03-16 18:35:38,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:38,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:38,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 18:35:38,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 18:35:38,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:38,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:38,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:38,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224679403] [2025-03-16 18:35:38,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224679403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:38,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:38,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:38,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688985071] [2025-03-16 18:35:38,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:38,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:38,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:38,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:38,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:38,408 INFO L87 Difference]: Start difference. First operand 529 states and 866 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:38,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:38,483 INFO L93 Difference]: Finished difference Result 1032 states and 1703 transitions. [2025-03-16 18:35:38,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:38,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2025-03-16 18:35:38,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:38,489 INFO L225 Difference]: With dead ends: 1032 [2025-03-16 18:35:38,489 INFO L226 Difference]: Without dead ends: 529 [2025-03-16 18:35:38,491 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-03-16 18:35:38,491 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 17 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4236 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-03-16 18:35:38,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4236 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:38,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-16 18:35:38,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-03-16 18:35:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 410 states have (on average 1.6585365853658536) internal successors, (680), 429 states have internal predecessors, (680), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:35:38,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 865 transitions. [2025-03-16 18:35:38,509 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 865 transitions. Word has length 93 [2025-03-16 18:35:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:38,509 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 865 transitions. [2025-03-16 18:35:38,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 865 transitions. [2025-03-16 18:35:38,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 18:35:38,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:38,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:38,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 18:35:38,514 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:38,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:38,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1742649727, now seen corresponding path program 1 times [2025-03-16 18:35:38,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:38,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234189250] [2025-03-16 18:35:38,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:38,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:38,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 18:35:38,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 18:35:38,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:38,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:38,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:38,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234189250] [2025-03-16 18:35:38,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234189250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:38,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:38,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:38,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27395628] [2025-03-16 18:35:38,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:38,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:38,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:38,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:38,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:38,626 INFO L87 Difference]: Start difference. First operand 529 states and 865 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:38,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:38,687 INFO L93 Difference]: Finished difference Result 1032 states and 1702 transitions. [2025-03-16 18:35:38,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:38,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2025-03-16 18:35:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:38,692 INFO L225 Difference]: With dead ends: 1032 [2025-03-16 18:35:38,692 INFO L226 Difference]: Without dead ends: 529 [2025-03-16 18:35:38,694 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-03-16 18:35:38,695 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 16 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4236 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-03-16 18:35:38,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4236 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:38,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-16 18:35:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-03-16 18:35:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 410 states have (on average 1.6560975609756097) internal successors, (679), 429 states have internal predecessors, (679), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:35:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 864 transitions. [2025-03-16 18:35:38,711 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 864 transitions. Word has length 94 [2025-03-16 18:35:38,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:38,712 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 864 transitions. [2025-03-16 18:35:38,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:38,712 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 864 transitions. [2025-03-16 18:35:38,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 18:35:38,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:38,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:38,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 18:35:38,715 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:38,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:38,715 INFO L85 PathProgramCache]: Analyzing trace with hash 892852817, now seen corresponding path program 1 times [2025-03-16 18:35:38,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:38,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148084475] [2025-03-16 18:35:38,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:38,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:38,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 18:35:38,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 18:35:38,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:38,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:38,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:38,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148084475] [2025-03-16 18:35:38,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148084475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:38,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:38,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:38,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320195183] [2025-03-16 18:35:38,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:38,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:38,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:38,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:38,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:38,802 INFO L87 Difference]: Start difference. First operand 529 states and 864 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:38,837 INFO L93 Difference]: Finished difference Result 1026 states and 1690 transitions. [2025-03-16 18:35:38,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:38,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 95 [2025-03-16 18:35:38,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:38,841 INFO L225 Difference]: With dead ends: 1026 [2025-03-16 18:35:38,841 INFO L226 Difference]: Without dead ends: 529 [2025-03-16 18:35:38,843 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-03-16 18:35:38,844 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 5 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2546 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-03-16 18:35:38,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2546 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-16 18:35:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-03-16 18:35:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 410 states have (on average 1.6536585365853658) internal successors, (678), 429 states have internal predecessors, (678), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:35:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 863 transitions. [2025-03-16 18:35:38,859 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 863 transitions. Word has length 95 [2025-03-16 18:35:38,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:38,859 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 863 transitions. [2025-03-16 18:35:38,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:35:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 863 transitions. [2025-03-16 18:35:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 18:35:38,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:38,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:38,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 18:35:38,862 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:38,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:38,862 INFO L85 PathProgramCache]: Analyzing trace with hash 349526956, now seen corresponding path program 1 times [2025-03-16 18:35:38,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:38,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265422044] [2025-03-16 18:35:38,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:38,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:38,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 18:35:38,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 18:35:38,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:38,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:39,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:39,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265422044] [2025-03-16 18:35:39,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265422044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:39,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:39,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:35:39,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883657530] [2025-03-16 18:35:39,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:39,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:35:39,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:39,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:35:39,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:35:39,072 INFO L87 Difference]: Start difference. First operand 529 states and 863 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-16 18:35:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:40,551 INFO L93 Difference]: Finished difference Result 1022 states and 1702 transitions. [2025-03-16 18:35:40,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:35:40,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 96 [2025-03-16 18:35:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:40,557 INFO L225 Difference]: With dead ends: 1022 [2025-03-16 18:35:40,557 INFO L226 Difference]: Without dead ends: 533 [2025-03-16 18:35:40,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:35:40,560 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 1331 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 3185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:40,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1533 Invalid, 3185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 2795 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 18:35:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-16 18:35:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2025-03-16 18:35:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 413 states have (on average 1.6489104116222761) internal successors, (681), 432 states have internal predecessors, (681), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (106), 89 states have call predecessors, (106), 90 states have call successors, (106) [2025-03-16 18:35:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 882 transitions. [2025-03-16 18:35:40,582 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 882 transitions. Word has length 96 [2025-03-16 18:35:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:40,582 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 882 transitions. [2025-03-16 18:35:40,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-16 18:35:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 882 transitions. [2025-03-16 18:35:40,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 18:35:40,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:40,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:40,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 18:35:40,585 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:40,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:40,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1087988635, now seen corresponding path program 1 times [2025-03-16 18:35:40,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:40,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388871423] [2025-03-16 18:35:40,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:40,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:40,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 18:35:40,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 18:35:40,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:40,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:40,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:40,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388871423] [2025-03-16 18:35:40,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388871423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:40,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:40,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:35:40,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103674811] [2025-03-16 18:35:40,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:40,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:35:40,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:40,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:35:40,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:35:40,727 INFO L87 Difference]: Start difference. First operand 533 states and 882 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-16 18:35:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:43,812 INFO L93 Difference]: Finished difference Result 1932 states and 3297 transitions. [2025-03-16 18:35:43,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 18:35:43,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 97 [2025-03-16 18:35:43,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:43,821 INFO L225 Difference]: With dead ends: 1932 [2025-03-16 18:35:43,821 INFO L226 Difference]: Without dead ends: 1439 [2025-03-16 18:35:43,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 18:35:43,824 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 2442 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 5052 mSolverCounterSat, 616 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2520 SdHoareTripleChecker+Valid, 2490 SdHoareTripleChecker+Invalid, 5668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 616 IncrementalHoareTripleChecker+Valid, 5052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:43,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2520 Valid, 2490 Invalid, 5668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [616 Valid, 5052 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 18:35:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-03-16 18:35:43,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1381. [2025-03-16 18:35:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1068 states have (on average 1.655430711610487) internal successors, (1768), 1116 states have internal predecessors, (1768), 249 states have call successors, (249), 63 states have call predecessors, (249), 63 states have return successors, (270), 238 states have call predecessors, (270), 244 states have call successors, (270) [2025-03-16 18:35:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2287 transitions. [2025-03-16 18:35:43,877 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2287 transitions. Word has length 97 [2025-03-16 18:35:43,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:43,878 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 2287 transitions. [2025-03-16 18:35:43,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-16 18:35:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2287 transitions. [2025-03-16 18:35:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 18:35:43,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:43,880 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:43,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 18:35:43,880 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:43,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:43,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1631061926, now seen corresponding path program 1 times [2025-03-16 18:35:43,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:43,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6307664] [2025-03-16 18:35:43,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:43,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:43,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 18:35:43,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 18:35:43,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:43,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:35:43,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:43,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6307664] [2025-03-16 18:35:43,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6307664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:43,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:43,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:35:43,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057153117] [2025-03-16 18:35:43,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:43,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:35:43,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:43,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:35:43,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:35:43,984 INFO L87 Difference]: Start difference. First operand 1381 states and 2287 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-16 18:35:45,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:45,415 INFO L93 Difference]: Finished difference Result 3171 states and 5251 transitions. [2025-03-16 18:35:45,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:45,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 99 [2025-03-16 18:35:45,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:45,427 INFO L225 Difference]: With dead ends: 3171 [2025-03-16 18:35:45,427 INFO L226 Difference]: Without dead ends: 2166 [2025-03-16 18:35:45,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:35:45,432 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 1723 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1795 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:45,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1795 Valid, 1222 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 18:35:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2025-03-16 18:35:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2065. [2025-03-16 18:35:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2065 states, 1556 states have (on average 1.6259640102827764) internal successors, (2530), 1636 states have internal predecessors, (2530), 414 states have call successors, (414), 92 states have call predecessors, (414), 94 states have return successors, (458), 396 states have call predecessors, (458), 409 states have call successors, (458) [2025-03-16 18:35:45,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 3402 transitions. [2025-03-16 18:35:45,541 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 3402 transitions. Word has length 99 [2025-03-16 18:35:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:45,542 INFO L471 AbstractCegarLoop]: Abstraction has 2065 states and 3402 transitions. [2025-03-16 18:35:45,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-16 18:35:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 3402 transitions. [2025-03-16 18:35:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 18:35:45,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:45,544 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:45,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 18:35:45,544 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:45,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:45,544 INFO L85 PathProgramCache]: Analyzing trace with hash 692965913, now seen corresponding path program 1 times [2025-03-16 18:35:45,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:45,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263093221] [2025-03-16 18:35:45,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:45,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:45,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 18:35:45,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 18:35:45,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:45,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:35:45,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:45,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263093221] [2025-03-16 18:35:45,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263093221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:45,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:45,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:45,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222555732] [2025-03-16 18:35:45,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:45,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:45,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:45,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:45,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:45,649 INFO L87 Difference]: Start difference. First operand 2065 states and 3402 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:35:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:47,818 INFO L93 Difference]: Finished difference Result 7440 states and 12633 transitions. [2025-03-16 18:35:47,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:35:47,819 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), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 99 [2025-03-16 18:35:47,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:47,849 INFO L225 Difference]: With dead ends: 7440 [2025-03-16 18:35:47,849 INFO L226 Difference]: Without dead ends: 5410 [2025-03-16 18:35:47,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:35:47,859 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 3434 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 3436 mSolverCounterSat, 1028 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3476 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 4464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1028 IncrementalHoareTripleChecker+Valid, 3436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:47,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3476 Valid, 2172 Invalid, 4464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1028 Valid, 3436 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 18:35:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2025-03-16 18:35:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 4853. [2025-03-16 18:35:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4853 states, 3471 states have (on average 1.606453471622011) internal successors, (5576), 3714 states have internal predecessors, (5576), 1186 states have call successors, (1186), 177 states have call predecessors, (1186), 195 states have return successors, (1367), 1161 states have call predecessors, (1367), 1181 states have call successors, (1367) [2025-03-16 18:35:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 8129 transitions. [2025-03-16 18:35:48,172 INFO L78 Accepts]: Start accepts. Automaton has 4853 states and 8129 transitions. Word has length 99 [2025-03-16 18:35:48,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:48,172 INFO L471 AbstractCegarLoop]: Abstraction has 4853 states and 8129 transitions. [2025-03-16 18:35:48,172 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), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:35:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 4853 states and 8129 transitions. [2025-03-16 18:35:48,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 18:35:48,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:48,175 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:48,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 18:35:48,175 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:48,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash -118128162, now seen corresponding path program 1 times [2025-03-16 18:35:48,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:48,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114799616] [2025-03-16 18:35:48,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:48,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:48,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 18:35:48,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 18:35:48,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:48,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:35:48,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:48,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114799616] [2025-03-16 18:35:48,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114799616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:48,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:48,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:48,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530589245] [2025-03-16 18:35:48,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:48,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:48,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:48,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:48,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:48,322 INFO L87 Difference]: Start difference. First operand 4853 states and 8129 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:35:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:50,772 INFO L93 Difference]: Finished difference Result 18943 states and 32822 transitions. [2025-03-16 18:35:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:35:50,773 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), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 100 [2025-03-16 18:35:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:50,860 INFO L225 Difference]: With dead ends: 18943 [2025-03-16 18:35:50,861 INFO L226 Difference]: Without dead ends: 14132 [2025-03-16 18:35:50,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:35:50,886 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 3447 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 3407 mSolverCounterSat, 1047 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3490 SdHoareTripleChecker+Valid, 2185 SdHoareTripleChecker+Invalid, 4454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1047 IncrementalHoareTripleChecker+Valid, 3407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:50,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3490 Valid, 2185 Invalid, 4454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1047 Valid, 3407 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 18:35:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14132 states. [2025-03-16 18:35:51,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14132 to 12475. [2025-03-16 18:35:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12475 states, 8417 states have (on average 1.5851253415706308) internal successors, (13342), 9133 states have internal predecessors, (13342), 3638 states have call successors, (3638), 349 states have call predecessors, (3638), 419 states have return successors, (4383), 3617 states have call predecessors, (4383), 3633 states have call successors, (4383) [2025-03-16 18:35:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12475 states to 12475 states and 21363 transitions. [2025-03-16 18:35:51,775 INFO L78 Accepts]: Start accepts. Automaton has 12475 states and 21363 transitions. Word has length 100 [2025-03-16 18:35:51,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:51,776 INFO L471 AbstractCegarLoop]: Abstraction has 12475 states and 21363 transitions. [2025-03-16 18:35:51,776 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), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:35:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 12475 states and 21363 transitions. [2025-03-16 18:35:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 18:35:51,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:51,779 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:51,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 18:35:51,780 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:51,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:51,780 INFO L85 PathProgramCache]: Analyzing trace with hash -734374412, now seen corresponding path program 1 times [2025-03-16 18:35:51,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:51,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768899698] [2025-03-16 18:35:51,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:51,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:51,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 18:35:51,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 18:35:51,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:51,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:35:51,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:51,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768899698] [2025-03-16 18:35:51,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768899698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:51,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:51,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:51,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724775592] [2025-03-16 18:35:51,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:51,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:51,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:51,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:51,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:51,887 INFO L87 Difference]: Start difference. First operand 12475 states and 21363 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:35:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:56,033 INFO L93 Difference]: Finished difference Result 53059 states and 94117 transitions. [2025-03-16 18:35:56,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:35:56,034 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), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 101 [2025-03-16 18:35:56,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:56,303 INFO L225 Difference]: With dead ends: 53059 [2025-03-16 18:35:56,304 INFO L226 Difference]: Without dead ends: 40628 [2025-03-16 18:35:56,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:35:56,373 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 3459 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 3414 mSolverCounterSat, 1050 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3503 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 4464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1050 IncrementalHoareTripleChecker+Valid, 3414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:56,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3503 Valid, 2206 Invalid, 4464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1050 Valid, 3414 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 18:35:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40628 states. [2025-03-16 18:35:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40628 to 35277. [2025-03-16 18:35:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35277 states, 22491 states have (on average 1.5664488017429194) internal successors, (35231), 24674 states have internal predecessors, (35231), 11840 states have call successors, (11840), 693 states have call predecessors, (11840), 945 states have return successors, (15047), 11899 states have call predecessors, (15047), 11835 states have call successors, (15047) [2025-03-16 18:35:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35277 states to 35277 states and 62118 transitions. [2025-03-16 18:35:59,339 INFO L78 Accepts]: Start accepts. Automaton has 35277 states and 62118 transitions. Word has length 101 [2025-03-16 18:35:59,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:59,340 INFO L471 AbstractCegarLoop]: Abstraction has 35277 states and 62118 transitions. [2025-03-16 18:35:59,340 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), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:35:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 35277 states and 62118 transitions. [2025-03-16 18:35:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 18:35:59,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:59,343 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:35:59,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 18:35:59,344 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:59,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:59,344 INFO L85 PathProgramCache]: Analyzing trace with hash 394694617, now seen corresponding path program 1 times [2025-03-16 18:35:59,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:59,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770057953] [2025-03-16 18:35:59,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:59,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:59,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 18:35:59,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 18:35:59,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:59,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:59,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:35:59,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:59,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770057953] [2025-03-16 18:35:59,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770057953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:59,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:59,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:59,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162203565] [2025-03-16 18:35:59,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:59,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:59,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:59,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:59,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:59,719 INFO L87 Difference]: Start difference. First operand 35277 states and 62118 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:36:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:10,143 INFO L93 Difference]: Finished difference Result 162077 states and 294825 transitions. [2025-03-16 18:36:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:36:10,144 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), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 102 [2025-03-16 18:36:10,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:11,321 INFO L225 Difference]: With dead ends: 162077 [2025-03-16 18:36:11,321 INFO L226 Difference]: Without dead ends: 126848 [2025-03-16 18:36:11,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:36:11,607 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 3471 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 3423 mSolverCounterSat, 1052 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3516 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 4475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1052 IncrementalHoareTripleChecker+Valid, 3423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:11,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3516 Valid, 2227 Invalid, 4475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1052 Valid, 3423 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 18:36:11,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126848 states. [2025-03-16 18:36:19,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126848 to 108915. [2025-03-16 18:36:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108915 states, 66515 states have (on average 1.5537547921521462) internal successors, (103348), 73439 states have internal predecessors, (103348), 40102 states have call successors, (40102), 1381 states have call predecessors, (40102), 2297 states have return successors, (54013), 40609 states have call predecessors, (54013), 40097 states have call successors, (54013) [2025-03-16 18:36:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108915 states to 108915 states and 197463 transitions. [2025-03-16 18:36:20,888 INFO L78 Accepts]: Start accepts. Automaton has 108915 states and 197463 transitions. Word has length 102 [2025-03-16 18:36:20,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:20,888 INFO L471 AbstractCegarLoop]: Abstraction has 108915 states and 197463 transitions. [2025-03-16 18:36:20,889 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), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:36:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 108915 states and 197463 transitions. [2025-03-16 18:36:20,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 18:36:20,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:20,891 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 18:36:20,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 18:36:20,891 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:20,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:20,892 INFO L85 PathProgramCache]: Analyzing trace with hash -206037553, now seen corresponding path program 1 times [2025-03-16 18:36:20,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:20,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407053660] [2025-03-16 18:36:20,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:20,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:20,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 18:36:20,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 18:36:20,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:20,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:36:21,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:21,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407053660] [2025-03-16 18:36:21,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407053660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:21,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:21,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:36:21,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753535766] [2025-03-16 18:36:21,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:21,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:36:21,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:21,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:36:21,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:36:21,019 INFO L87 Difference]: Start difference. First operand 108915 states and 197463 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11)