./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_spec9_product32.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 6f20249a191004f50add5285446ee5ffba043f1ff9b40e0e115c641082e595e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:19:08,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:19:08,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:19:08,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:19:08,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:19:08,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:19:08,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:19:08,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:19:08,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:19:08,214 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:19:08,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:19:08,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:19:08,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:19:08,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:19:08,215 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:19:08,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:19:08,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:19:08,215 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:19:08,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:19:08,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:19:08,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:19:08,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:19:08,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:19:08,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:19:08,216 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:19:08,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:19:08,216 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:19:08,216 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:19:08,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:19:08,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:19:08,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:19:08,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:19:08,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:19:08,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:19:08,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:19:08,217 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:19:08,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:19:08,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:19:08,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:19:08,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:19:08,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:19:08,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:19:08,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:19:08,217 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 -> 6f20249a191004f50add5285446ee5ffba043f1ff9b40e0e115c641082e595e2 [2025-03-03 14:19:08,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:19:08,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:19:08,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:19:08,473 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:19:08,473 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:19:08,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c [2025-03-03 14:19:09,656 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc72f218/74804e965fb44e8382cbf89b53d3b319/FLAGf30f2baca [2025-03-03 14:19:09,963 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:19:09,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c [2025-03-03 14:19:09,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc72f218/74804e965fb44e8382cbf89b53d3b319/FLAGf30f2baca [2025-03-03 14:19:09,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc72f218/74804e965fb44e8382cbf89b53d3b319 [2025-03-03 14:19:09,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:19:10,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:19:10,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:19:10,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:19:10,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:19:10,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:19:09" (1/1) ... [2025-03-03 14:19:10,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd2c415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:10, skipping insertion in model container [2025-03-03 14:19:10,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:19:09" (1/1) ... [2025-03-03 14:19:10,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:19:10,244 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_spec9_product32.cil.c[17414,17427] [2025-03-03 14:19:10,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:19:10,503 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:19:10,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2025-03-03 14:19:10,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [716] [2025-03-03 14:19:10,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [725] [2025-03-03 14:19:10,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [739] [2025-03-03 14:19:10,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [905] [2025-03-03 14:19:10,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2574] [2025-03-03 14:19:10,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2940] [2025-03-03 14:19:10,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2978] [2025-03-03 14:19:10,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3330] [2025-03-03 14:19:10,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3448] [2025-03-03 14:19:10,531 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_spec9_product32.cil.c[17414,17427] [2025-03-03 14:19:10,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:19:10,626 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:19:10,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:10 WrapperNode [2025-03-03 14:19:10,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:19:10,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:19:10,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:19:10,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:19:10,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:10" (1/1) ... [2025-03-03 14:19:10,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:10" (1/1) ... [2025-03-03 14:19:10,683 INFO L138 Inliner]: procedures = 99, calls = 352, calls flagged for inlining = 28, calls inlined = 24, statements flattened = 930 [2025-03-03 14:19:10,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:19:10,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:19:10,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:19:10,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:19:10,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:10" (1/1) ... [2025-03-03 14:19:10,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:10" (1/1) ... [2025-03-03 14:19:10,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:10" (1/1) ... [2025-03-03 14:19:10,728 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-03 14:19:10,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:10" (1/1) ... [2025-03-03 14:19:10,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:10" (1/1) ... [2025-03-03 14:19:10,753 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:10" (1/1) ... [2025-03-03 14:19:10,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:10" (1/1) ... [2025-03-03 14:19:10,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:10" (1/1) ... [2025-03-03 14:19:10,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:10" (1/1) ... [2025-03-03 14:19:10,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:19:10,781 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:19:10,781 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:19:10,781 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:19:10,782 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:10" (1/1) ... [2025-03-03 14:19:10,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:19:10,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:10,810 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-03 14:19:10,813 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-03 14:19:10,832 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:19:10,833 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:19:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:19:10,833 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:19:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:19:10,833 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:19:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-03-03 14:19:10,833 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-03-03 14:19:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:19:10,833 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:19:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:19:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-03 14:19:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-03 14:19:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:19:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:19:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-03 14:19:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:19:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-03 14:19:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:19:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:19:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-03 14:19:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:19:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:19:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:19:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:19:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:19:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:19:10,835 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:19:10,835 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:19:10,835 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-03-03 14:19:10,835 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:19:10,835 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:19:10,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:19:10,835 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:19:10,835 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2025-03-03 14:19:10,835 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2025-03-03 14:19:11,004 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:19:11,007 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:19:11,069 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1887: #res#1 := ~retValue_acc~16#1; [2025-03-03 14:19:11,069 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~15#1; [2025-03-03 14:19:11,094 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3367: #res := ~retValue_acc~29; [2025-03-03 14:19:11,119 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2562: #res := ~retValue_acc~20; [2025-03-03 14:19:11,206 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1803-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~14#1; [2025-03-03 14:19:11,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1740-1: stopRequestedInDirection__wrappee__twothirdsfull_#res#1 := stopRequestedInDirection__wrappee__twothirdsfull_~retValue_acc~12#1; [2025-03-03 14:19:11,210 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1769: #res#1 := ~retValue_acc~13#1; [2025-03-03 14:19:11,214 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1932: #res := ~retValue_acc~18; [2025-03-03 14:19:11,389 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1700: #res := ~retValue_acc~11; [2025-03-03 14:19:11,488 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1335-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~9#1; [2025-03-03 14:19:11,488 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1348-1: isIdle_#res#1 := isIdle_~retValue_acc~10#1; [2025-03-03 14:19:11,490 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1172: #res := ~retValue_acc~5; [2025-03-03 14:19:11,494 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: #res := ~retValue_acc~2; [2025-03-03 14:19:11,504 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3445: #res := ~retValue_acc~31; [2025-03-03 14:19:11,505 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L986: #res := ~retValue_acc~3; [2025-03-03 14:19:11,507 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1163: #res := ~retValue_acc~4; [2025-03-03 14:19:11,631 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3406: #res := ~retValue_acc~30; [2025-03-03 14:19:11,650 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255: #res := ~retValue_acc~8; [2025-03-03 14:19:11,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1206: #res := ~retValue_acc~6; [2025-03-03 14:19:11,735 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L402: #res := ~retValue_acc~1; [2025-03-03 14:19:11,796 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975-1: valid_product_#res#1 := valid_product_~retValue_acc~26#1; [2025-03-03 14:19:11,796 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3327-1: main_#res#1 := main_~retValue_acc~28#1; [2025-03-03 14:19:11,804 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: #res := ~retValue_acc~0; [2025-03-03 14:19:11,910 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1918-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~17#1; [2025-03-03 14:19:12,014 INFO L? ?]: Removed 478 outVars from TransFormulas that were not future-live. [2025-03-03 14:19:12,014 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:19:12,038 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:19:12,038 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:19:12,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:19:12 BoogieIcfgContainer [2025-03-03 14:19:12,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:19:12,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:19:12,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:19:12,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:19:12,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:19:09" (1/3) ... [2025-03-03 14:19:12,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b314c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:19:12, skipping insertion in model container [2025-03-03 14:19:12,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:10" (2/3) ... [2025-03-03 14:19:12,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b314c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:19:12, skipping insertion in model container [2025-03-03 14:19:12,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:19:12" (3/3) ... [2025-03-03 14:19:12,045 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product32.cil.c [2025-03-03 14:19:12,059 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:19:12,061 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product32.cil.c that has 29 procedures, 599 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:19:12,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:19:12,128 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;@382adc67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:19:12,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:19:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 599 states, 466 states have (on average 1.6759656652360515) internal successors, (781), 489 states have internal predecessors, (781), 103 states have call successors, (103), 28 states have call predecessors, (103), 28 states have return successors, (103), 96 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-03 14:19:12,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 14:19:12,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:12,143 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] [2025-03-03 14:19:12,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:12,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:12,148 INFO L85 PathProgramCache]: Analyzing trace with hash -392626300, now seen corresponding path program 1 times [2025-03-03 14:19:12,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:12,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875591731] [2025-03-03 14:19:12,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:12,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:12,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:19:12,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:19:12,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:12,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:12,620 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-03 14:19:12,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:12,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875591731] [2025-03-03 14:19:12,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875591731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:12,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:12,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:12,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000039417] [2025-03-03 14:19:12,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:12,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:12,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:12,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:12,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:12,650 INFO L87 Difference]: Start difference. First operand has 599 states, 466 states have (on average 1.6759656652360515) internal successors, (781), 489 states have internal predecessors, (781), 103 states have call successors, (103), 28 states have call predecessors, (103), 28 states have return successors, (103), 96 states have call predecessors, (103), 103 states have call successors, (103) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:12,813 INFO L93 Difference]: Finished difference Result 1178 states and 1949 transitions. [2025-03-03 14:19:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:12,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2025-03-03 14:19:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:12,829 INFO L225 Difference]: With dead ends: 1178 [2025-03-03 14:19:12,830 INFO L226 Difference]: Without dead ends: 591 [2025-03-03 14:19:12,836 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-03 14:19:12,838 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 5 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2897 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-03 14:19:12,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2897 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-03 14:19:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-03-03 14:19:12,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 460 states have (on average 1.673913043478261) internal successors, (770), 481 states have internal predecessors, (770), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:19:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 971 transitions. [2025-03-03 14:19:12,909 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 971 transitions. Word has length 62 [2025-03-03 14:19:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:12,910 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 971 transitions. [2025-03-03 14:19:12,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:12,911 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 971 transitions. [2025-03-03 14:19:12,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 14:19:12,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:12,915 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] [2025-03-03 14:19:12,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:19:12,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:12,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:12,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1298463708, now seen corresponding path program 1 times [2025-03-03 14:19:12,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:12,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577651404] [2025-03-03 14:19:12,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:12,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:12,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 14:19:12,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 14:19:12,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:12,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:13,126 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-03 14:19:13,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:13,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577651404] [2025-03-03 14:19:13,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577651404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:13,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:13,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:13,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282335699] [2025-03-03 14:19:13,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:13,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:13,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:13,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:13,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:13,129 INFO L87 Difference]: Start difference. First operand 591 states and 971 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:13,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:13,213 INFO L93 Difference]: Finished difference Result 1164 states and 1919 transitions. [2025-03-03 14:19:13,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:13,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2025-03-03 14:19:13,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:13,219 INFO L225 Difference]: With dead ends: 1164 [2025-03-03 14:19:13,219 INFO L226 Difference]: Without dead ends: 591 [2025-03-03 14:19:13,222 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-03 14:19:13,222 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 4 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2876 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-03 14:19:13,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2876 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-03 14:19:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-03-03 14:19:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 460 states have (on average 1.6717391304347826) internal successors, (769), 481 states have internal predecessors, (769), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:19:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 970 transitions. [2025-03-03 14:19:13,252 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 970 transitions. Word has length 65 [2025-03-03 14:19:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:13,252 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 970 transitions. [2025-03-03 14:19:13,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 970 transitions. [2025-03-03 14:19:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:19:13,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:13,255 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] [2025-03-03 14:19:13,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:19:13,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:13,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash -895279394, now seen corresponding path program 1 times [2025-03-03 14:19:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:13,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333549488] [2025-03-03 14:19:13,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:13,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:13,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:19:13,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:19:13,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:13,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:13,396 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-03 14:19:13,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:13,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333549488] [2025-03-03 14:19:13,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333549488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:13,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:13,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:13,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097764963] [2025-03-03 14:19:13,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:13,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:13,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:13,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:13,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:13,398 INFO L87 Difference]: Start difference. First operand 591 states and 970 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:13,463 INFO L93 Difference]: Finished difference Result 1164 states and 1918 transitions. [2025-03-03 14:19:13,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:13,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2025-03-03 14:19:13,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:13,474 INFO L225 Difference]: With dead ends: 1164 [2025-03-03 14:19:13,475 INFO L226 Difference]: Without dead ends: 591 [2025-03-03 14:19:13,477 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-03 14:19:13,480 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 3 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2876 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-03 14:19:13,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2876 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-03 14:19:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-03-03 14:19:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 460 states have (on average 1.6695652173913043) internal successors, (768), 481 states have internal predecessors, (768), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:19:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 969 transitions. [2025-03-03 14:19:13,513 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 969 transitions. Word has length 66 [2025-03-03 14:19:13,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:13,514 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 969 transitions. [2025-03-03 14:19:13,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:13,515 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 969 transitions. [2025-03-03 14:19:13,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:19:13,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:13,518 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] [2025-03-03 14:19:13,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:19:13,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:13,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:13,520 INFO L85 PathProgramCache]: Analyzing trace with hash 143430521, now seen corresponding path program 1 times [2025-03-03 14:19:13,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:13,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950073002] [2025-03-03 14:19:13,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:13,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:13,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:19:13,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:19:13,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:13,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:13,658 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-03 14:19:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:13,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950073002] [2025-03-03 14:19:13,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950073002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:13,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:13,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:13,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463567803] [2025-03-03 14:19:13,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:13,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:13,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:13,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:13,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:13,661 INFO L87 Difference]: Start difference. First operand 591 states and 969 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:13,713 INFO L93 Difference]: Finished difference Result 1164 states and 1917 transitions. [2025-03-03 14:19:13,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:13,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2025-03-03 14:19:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:13,721 INFO L225 Difference]: With dead ends: 1164 [2025-03-03 14:19:13,721 INFO L226 Difference]: Without dead ends: 591 [2025-03-03 14:19:13,724 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-03 14:19:13,726 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 2 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2876 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-03 14:19:13,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2876 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:13,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-03 14:19:13,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-03-03 14:19:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 460 states have (on average 1.6673913043478261) internal successors, (767), 481 states have internal predecessors, (767), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:19:13,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 968 transitions. [2025-03-03 14:19:13,754 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 968 transitions. Word has length 67 [2025-03-03 14:19:13,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:13,755 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 968 transitions. [2025-03-03 14:19:13,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:13,755 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 968 transitions. [2025-03-03 14:19:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:19:13,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:13,757 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] [2025-03-03 14:19:13,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:19:13,757 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:13,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:13,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1691031141, now seen corresponding path program 1 times [2025-03-03 14:19:13,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:13,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711523318] [2025-03-03 14:19:13,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:13,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:13,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:19:13,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:19:13,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:13,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:13,884 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-03 14:19:13,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:13,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711523318] [2025-03-03 14:19:13,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711523318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:13,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:13,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:13,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319296944] [2025-03-03 14:19:13,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:13,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:13,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:13,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:13,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:13,885 INFO L87 Difference]: Start difference. First operand 591 states and 968 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:13,919 INFO L93 Difference]: Finished difference Result 1164 states and 1916 transitions. [2025-03-03 14:19:13,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:13,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2025-03-03 14:19:13,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:13,923 INFO L225 Difference]: With dead ends: 1164 [2025-03-03 14:19:13,923 INFO L226 Difference]: Without dead ends: 591 [2025-03-03 14:19:13,925 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-03 14:19:13,925 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 1 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2876 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-03 14:19:13,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2876 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-03 14:19:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-03-03 14:19:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 460 states have (on average 1.6652173913043478) internal successors, (766), 481 states have internal predecessors, (766), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:19:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 967 transitions. [2025-03-03 14:19:13,942 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 967 transitions. Word has length 68 [2025-03-03 14:19:13,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:13,942 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 967 transitions. [2025-03-03 14:19:13,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 967 transitions. [2025-03-03 14:19:13,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:19:13,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:13,943 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] [2025-03-03 14:19:13,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:19:13,943 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:13,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:13,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1895468822, now seen corresponding path program 1 times [2025-03-03 14:19:13,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:13,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843785261] [2025-03-03 14:19:13,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:13,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:13,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:19:13,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:19:13,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:13,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:14,145 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-03 14:19:14,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:14,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843785261] [2025-03-03 14:19:14,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843785261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:14,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:14,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:19:14,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816127341] [2025-03-03 14:19:14,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:14,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:19:14,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:14,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:19:14,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:14,148 INFO L87 Difference]: Start difference. First operand 591 states and 967 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:19:14,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:14,259 INFO L93 Difference]: Finished difference Result 1130 states and 1848 transitions. [2025-03-03 14:19:14,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:19:14,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2025-03-03 14:19:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:14,265 INFO L225 Difference]: With dead ends: 1130 [2025-03-03 14:19:14,265 INFO L226 Difference]: Without dead ends: 606 [2025-03-03 14:19:14,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:19:14,268 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 91 mSDsluCounter, 6602 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7557 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:14,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7557 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:14,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-03 14:19:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 604. [2025-03-03 14:19:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 470 states have (on average 1.6617021276595745) internal successors, (781), 493 states have internal predecessors, (781), 104 states have call successors, (104), 28 states have call predecessors, (104), 29 states have return successors, (101), 96 states have call predecessors, (101), 99 states have call successors, (101) [2025-03-03 14:19:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 986 transitions. [2025-03-03 14:19:14,289 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 986 transitions. Word has length 69 [2025-03-03 14:19:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:14,289 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 986 transitions. [2025-03-03 14:19:14,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:19:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 986 transitions. [2025-03-03 14:19:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:19:14,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:14,290 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] [2025-03-03 14:19:14,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:19:14,290 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:14,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:14,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1630328459, now seen corresponding path program 1 times [2025-03-03 14:19:14,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:14,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429409985] [2025-03-03 14:19:14,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:14,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:14,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:19:14,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:19:14,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:14,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:14,391 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-03 14:19:14,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:14,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429409985] [2025-03-03 14:19:14,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429409985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:14,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:14,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:14,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356402547] [2025-03-03 14:19:14,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:14,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:14,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:14,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:14,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:14,393 INFO L87 Difference]: Start difference. First operand 604 states and 986 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:14,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:14,432 INFO L93 Difference]: Finished difference Result 1182 states and 1942 transitions. [2025-03-03 14:19:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:14,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2025-03-03 14:19:14,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:14,436 INFO L225 Difference]: With dead ends: 1182 [2025-03-03 14:19:14,436 INFO L226 Difference]: Without dead ends: 585 [2025-03-03 14:19:14,438 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-03 14:19:14,439 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 0 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2878 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-03 14:19:14,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2878 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:14,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-03 14:19:14,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2025-03-03 14:19:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 454 states have (on average 1.6563876651982379) internal successors, (752), 475 states have internal predecessors, (752), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:19:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 953 transitions. [2025-03-03 14:19:14,460 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 953 transitions. Word has length 69 [2025-03-03 14:19:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:14,461 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 953 transitions. [2025-03-03 14:19:14,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:14,461 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 953 transitions. [2025-03-03 14:19:14,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:19:14,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:14,462 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] [2025-03-03 14:19:14,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:19:14,462 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:14,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:14,463 INFO L85 PathProgramCache]: Analyzing trace with hash 8114338, now seen corresponding path program 1 times [2025-03-03 14:19:14,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:14,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853849025] [2025-03-03 14:19:14,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:14,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:14,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:19:14,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:19:14,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:14,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:14,571 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-03 14:19:14,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:14,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853849025] [2025-03-03 14:19:14,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853849025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:14,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:14,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:14,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685098381] [2025-03-03 14:19:14,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:14,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:14,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:14,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:14,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:14,573 INFO L87 Difference]: Start difference. First operand 585 states and 953 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:14,721 INFO L93 Difference]: Finished difference Result 1127 states and 1840 transitions. [2025-03-03 14:19:14,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:14,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2025-03-03 14:19:14,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:14,726 INFO L225 Difference]: With dead ends: 1127 [2025-03-03 14:19:14,726 INFO L226 Difference]: Without dead ends: 594 [2025-03-03 14:19:14,728 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-03 14:19:14,729 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 55 mSDsluCounter, 3611 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4521 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-03 14:19:14,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4521 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:14,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-03 14:19:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 585. [2025-03-03 14:19:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 454 states have (on average 1.6475770925110131) internal successors, (748), 475 states have internal predecessors, (748), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:19:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 949 transitions. [2025-03-03 14:19:14,750 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 949 transitions. Word has length 70 [2025-03-03 14:19:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:14,750 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 949 transitions. [2025-03-03 14:19:14,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:14,750 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 949 transitions. [2025-03-03 14:19:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 14:19:14,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:14,752 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] [2025-03-03 14:19:14,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:19:14,753 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:14,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:14,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1382420563, now seen corresponding path program 1 times [2025-03-03 14:19:14,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:14,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549115660] [2025-03-03 14:19:14,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:14,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:14,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 14:19:14,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 14:19:14,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:14,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:14,861 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-03 14:19:14,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:14,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549115660] [2025-03-03 14:19:14,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549115660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:14,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:14,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:14,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287461677] [2025-03-03 14:19:14,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:14,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:14,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:14,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:14,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:14,864 INFO L87 Difference]: Start difference. First operand 585 states and 949 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:15,024 INFO L93 Difference]: Finished difference Result 1127 states and 1836 transitions. [2025-03-03 14:19:15,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:15,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-03-03 14:19:15,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:15,028 INFO L225 Difference]: With dead ends: 1127 [2025-03-03 14:19:15,028 INFO L226 Difference]: Without dead ends: 594 [2025-03-03 14:19:15,030 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-03 14:19:15,031 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 54 mSDsluCounter, 3611 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4521 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-03 14:19:15,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4521 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-03 14:19:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 585. [2025-03-03 14:19:15,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 454 states have (on average 1.6387665198237886) internal successors, (744), 475 states have internal predecessors, (744), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:19:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 945 transitions. [2025-03-03 14:19:15,049 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 945 transitions. Word has length 71 [2025-03-03 14:19:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:15,051 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 945 transitions. [2025-03-03 14:19:15,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:15,052 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 945 transitions. [2025-03-03 14:19:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 14:19:15,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:15,053 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] [2025-03-03 14:19:15,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:19:15,053 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:15,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:15,054 INFO L85 PathProgramCache]: Analyzing trace with hash -873375419, now seen corresponding path program 1 times [2025-03-03 14:19:15,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:15,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092518317] [2025-03-03 14:19:15,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:15,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:15,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:19:15,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:19:15,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:15,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:15,154 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-03 14:19:15,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:15,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092518317] [2025-03-03 14:19:15,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092518317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:15,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:15,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:15,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866858372] [2025-03-03 14:19:15,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:15,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:15,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:15,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:15,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:15,156 INFO L87 Difference]: Start difference. First operand 585 states and 945 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:15,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:15,292 INFO L93 Difference]: Finished difference Result 1127 states and 1832 transitions. [2025-03-03 14:19:15,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:15,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2025-03-03 14:19:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:15,297 INFO L225 Difference]: With dead ends: 1127 [2025-03-03 14:19:15,297 INFO L226 Difference]: Without dead ends: 594 [2025-03-03 14:19:15,299 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-03 14:19:15,300 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 53 mSDsluCounter, 3594 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4503 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-03 14:19:15,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4503 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-03 14:19:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 585. [2025-03-03 14:19:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 454 states have (on average 1.6299559471365639) internal successors, (740), 475 states have internal predecessors, (740), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:19:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 941 transitions. [2025-03-03 14:19:15,318 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 941 transitions. Word has length 72 [2025-03-03 14:19:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:15,318 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 941 transitions. [2025-03-03 14:19:15,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 941 transitions. [2025-03-03 14:19:15,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 14:19:15,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:15,320 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] [2025-03-03 14:19:15,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:19:15,320 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:15,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:15,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1668261364, now seen corresponding path program 1 times [2025-03-03 14:19:15,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:15,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094190878] [2025-03-03 14:19:15,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:15,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:15,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:19:15,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:19:15,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:15,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:15,418 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-03 14:19:15,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:15,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094190878] [2025-03-03 14:19:15,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094190878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:15,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:15,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:19:15,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941793502] [2025-03-03 14:19:15,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:15,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:19:15,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:15,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:19:15,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:15,420 INFO L87 Difference]: Start difference. First operand 585 states and 941 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:19:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:15,494 INFO L93 Difference]: Finished difference Result 1118 states and 1814 transitions. [2025-03-03 14:19:15,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:19:15,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 72 [2025-03-03 14:19:15,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:15,498 INFO L225 Difference]: With dead ends: 1118 [2025-03-03 14:19:15,498 INFO L226 Difference]: Without dead ends: 564 [2025-03-03 14:19:15,500 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-03 14:19:15,501 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 84 mSDsluCounter, 4577 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5507 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-03 14:19:15,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5507 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-03 14:19:15,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-03-03 14:19:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 433 states have (on average 1.630484988452656) internal successors, (706), 454 states have internal predecessors, (706), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:19:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 907 transitions. [2025-03-03 14:19:15,517 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 907 transitions. Word has length 72 [2025-03-03 14:19:15,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:15,517 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 907 transitions. [2025-03-03 14:19:15,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:19:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 907 transitions. [2025-03-03 14:19:15,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 14:19:15,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:15,518 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] [2025-03-03 14:19:15,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:19:15,519 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:15,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:15,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1606891024, now seen corresponding path program 1 times [2025-03-03 14:19:15,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:15,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156063082] [2025-03-03 14:19:15,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:15,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:15,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 14:19:15,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 14:19:15,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:15,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:15,620 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-03 14:19:15,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:15,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156063082] [2025-03-03 14:19:15,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156063082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:15,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:15,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:15,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626296435] [2025-03-03 14:19:15,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:15,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:15,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:15,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:15,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:15,621 INFO L87 Difference]: Start difference. First operand 564 states and 907 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:15,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:15,686 INFO L93 Difference]: Finished difference Result 1097 states and 1780 transitions. [2025-03-03 14:19:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:15,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-03-03 14:19:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:15,691 INFO L225 Difference]: With dead ends: 1097 [2025-03-03 14:19:15,691 INFO L226 Difference]: Without dead ends: 564 [2025-03-03 14:19:15,693 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-03 14:19:15,694 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 17 mSDsluCounter, 3551 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4441 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-03 14:19:15,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4441 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-03 14:19:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-03-03 14:19:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 433 states have (on average 1.628175519630485) internal successors, (705), 454 states have internal predecessors, (705), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:19:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 906 transitions. [2025-03-03 14:19:15,713 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 906 transitions. Word has length 73 [2025-03-03 14:19:15,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:15,713 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 906 transitions. [2025-03-03 14:19:15,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 906 transitions. [2025-03-03 14:19:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:19:15,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:15,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] [2025-03-03 14:19:15,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:19:15,714 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:15,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:15,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2089883112, now seen corresponding path program 1 times [2025-03-03 14:19:15,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:15,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417199683] [2025-03-03 14:19:15,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:15,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:15,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:19:15,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:19:15,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:15,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:15,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-03 14:19:15,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:15,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417199683] [2025-03-03 14:19:15,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417199683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:15,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:15,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:15,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290436916] [2025-03-03 14:19:15,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:15,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:15,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:15,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:15,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:15,802 INFO L87 Difference]: Start difference. First operand 564 states and 906 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:15,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:15,863 INFO L93 Difference]: Finished difference Result 1097 states and 1779 transitions. [2025-03-03 14:19:15,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:15,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-03 14:19:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:15,867 INFO L225 Difference]: With dead ends: 1097 [2025-03-03 14:19:15,867 INFO L226 Difference]: Without dead ends: 564 [2025-03-03 14:19:15,869 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-03 14:19:15,870 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 16 mSDsluCounter, 3551 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4441 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-03 14:19:15,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4441 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:15,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-03 14:19:15,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-03-03 14:19:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 433 states have (on average 1.625866050808314) internal successors, (704), 454 states have internal predecessors, (704), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:19:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 905 transitions. [2025-03-03 14:19:15,887 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 905 transitions. Word has length 74 [2025-03-03 14:19:15,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:15,887 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 905 transitions. [2025-03-03 14:19:15,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:19:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 905 transitions. [2025-03-03 14:19:15,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 14:19:15,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:15,889 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] [2025-03-03 14:19:15,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:19:15,889 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:15,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:15,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1391718451, now seen corresponding path program 1 times [2025-03-03 14:19:15,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:15,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48200599] [2025-03-03 14:19:15,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:15,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:15,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:19:15,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:19:15,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:15,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:16,063 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-03 14:19:16,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:16,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48200599] [2025-03-03 14:19:16,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48200599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:16,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:16,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:19:16,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143042007] [2025-03-03 14:19:16,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:16,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:19:16,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:16,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:19:16,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:19:16,064 INFO L87 Difference]: Start difference. First operand 564 states and 905 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:19:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:16,148 INFO L93 Difference]: Finished difference Result 1091 states and 1767 transitions. [2025-03-03 14:19:16,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:19:16,148 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2025-03-03 14:19:16,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:16,153 INFO L225 Difference]: With dead ends: 1091 [2025-03-03 14:19:16,153 INFO L226 Difference]: Without dead ends: 564 [2025-03-03 14:19:16,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:19:16,156 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 6 mSDsluCounter, 7090 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7979 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:16,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7979 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-03 14:19:16,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-03-03 14:19:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 433 states have (on average 1.6235565819861433) internal successors, (703), 454 states have internal predecessors, (703), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:19:16,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 904 transitions. [2025-03-03 14:19:16,176 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 904 transitions. Word has length 75 [2025-03-03 14:19:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:16,177 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 904 transitions. [2025-03-03 14:19:16,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:19:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 904 transitions. [2025-03-03 14:19:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:19:16,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:16,178 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] [2025-03-03 14:19:16,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:19:16,178 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:16,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:16,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1603079867, now seen corresponding path program 1 times [2025-03-03 14:19:16,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:16,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419783722] [2025-03-03 14:19:16,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:16,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:16,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:19:16,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:19:16,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:16,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:16,348 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-03 14:19:16,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:16,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419783722] [2025-03-03 14:19:16,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419783722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:16,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:16,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:16,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537965312] [2025-03-03 14:19:16,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:16,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:16,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:16,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:16,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:16,350 INFO L87 Difference]: Start difference. First operand 564 states and 904 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-03 14:19:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:18,264 INFO L93 Difference]: Finished difference Result 1737 states and 2847 transitions. [2025-03-03 14:19:18,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:18,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 76 [2025-03-03 14:19:18,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:18,273 INFO L225 Difference]: With dead ends: 1737 [2025-03-03 14:19:18,273 INFO L226 Difference]: Without dead ends: 1218 [2025-03-03 14:19:18,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:19:18,277 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 3352 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 2027 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3423 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 2027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:18,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3423 Valid, 951 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 2027 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:19:18,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-03-03 14:19:18,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1086. [2025-03-03 14:19:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 841 states have (on average 1.643281807372176) internal successors, (1382), 871 states have internal predecessors, (1382), 193 states have call successors, (193), 50 states have call predecessors, (193), 51 states have return successors, (195), 177 states have call predecessors, (195), 188 states have call successors, (195) [2025-03-03 14:19:18,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1770 transitions. [2025-03-03 14:19:18,331 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1770 transitions. Word has length 76 [2025-03-03 14:19:18,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:18,331 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1770 transitions. [2025-03-03 14:19:18,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-03 14:19:18,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1770 transitions. [2025-03-03 14:19:18,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:19:18,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:18,335 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:18,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:19:18,336 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:18,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:18,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1412551109, now seen corresponding path program 1 times [2025-03-03 14:19:18,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:18,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382027550] [2025-03-03 14:19:18,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:18,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:18,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:19:18,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:19:18,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:18,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:18,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:18,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382027550] [2025-03-03 14:19:18,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382027550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585798936] [2025-03-03 14:19:18,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:18,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:18,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:18,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:19:18,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:19:18,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:19:18,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:19:18,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:18,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:18,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 1719 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:19:18,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:19:18,812 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:18,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585798936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:18,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:18,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:19:18,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457024866] [2025-03-03 14:19:18,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:18,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:18,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:18,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:18,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:18,813 INFO L87 Difference]: Start difference. First operand 1086 states and 1770 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 14:19:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:18,877 INFO L93 Difference]: Finished difference Result 2730 states and 4499 transitions. [2025-03-03 14:19:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:18,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-03-03 14:19:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:18,887 INFO L225 Difference]: With dead ends: 2730 [2025-03-03 14:19:18,888 INFO L226 Difference]: Without dead ends: 1689 [2025-03-03 14:19:18,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:18,893 INFO L435 NwaCegarLoop]: 1023 mSDtfsCounter, 888 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:18,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 1866 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:18,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2025-03-03 14:19:18,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1687. [2025-03-03 14:19:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1302 states have (on average 1.6443932411674347) internal successors, (2141), 1348 states have internal predecessors, (2141), 304 states have call successors, (304), 76 states have call predecessors, (304), 80 states have return successors, (325), 287 states have call predecessors, (325), 299 states have call successors, (325) [2025-03-03 14:19:18,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2770 transitions. [2025-03-03 14:19:18,967 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2770 transitions. Word has length 131 [2025-03-03 14:19:18,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:18,968 INFO L471 AbstractCegarLoop]: Abstraction has 1687 states and 2770 transitions. [2025-03-03 14:19:18,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 14:19:18,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2770 transitions. [2025-03-03 14:19:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:19:18,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:18,972 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:18,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:19:19,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 14:19:19,173 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:19,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:19,173 INFO L85 PathProgramCache]: Analyzing trace with hash 839198191, now seen corresponding path program 1 times [2025-03-03 14:19:19,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:19,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837640719] [2025-03-03 14:19:19,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:19,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:19,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:19:19,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:19:19,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:19,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:19,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:19,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837640719] [2025-03-03 14:19:19,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837640719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:19,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566764398] [2025-03-03 14:19:19,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:19,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:19,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:19,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:19:19,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:19:19,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:19:19,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:19:19,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:19,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:19,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 1721 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:19:19,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:19:19,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:19,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566764398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:19,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:19,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:19:19,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399317182] [2025-03-03 14:19:19,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:19,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:19,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:19,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:19,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:19,659 INFO L87 Difference]: Start difference. First operand 1687 states and 2770 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 14:19:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:19,791 INFO L93 Difference]: Finished difference Result 4535 states and 7527 transitions. [2025-03-03 14:19:19,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:19,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2025-03-03 14:19:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:19,818 INFO L225 Difference]: With dead ends: 4535 [2025-03-03 14:19:19,818 INFO L226 Difference]: Without dead ends: 2893 [2025-03-03 14:19:19,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:19,830 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 887 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:19,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1824 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:19,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2025-03-03 14:19:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2890. [2025-03-03 14:19:19,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2890 states, 2225 states have (on average 1.644943820224719) internal successors, (3660), 2303 states have internal predecessors, (3660), 526 states have call successors, (526), 128 states have call predecessors, (526), 138 states have return successors, (603), 507 states have call predecessors, (603), 521 states have call successors, (603) [2025-03-03 14:19:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 4789 transitions. [2025-03-03 14:19:19,974 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 4789 transitions. Word has length 132 [2025-03-03 14:19:19,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:19,975 INFO L471 AbstractCegarLoop]: Abstraction has 2890 states and 4789 transitions. [2025-03-03 14:19:19,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 14:19:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 4789 transitions. [2025-03-03 14:19:19,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:19:19,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:19,980 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:19,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:19:20,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 14:19:20,181 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:20,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:20,181 INFO L85 PathProgramCache]: Analyzing trace with hash 245123135, now seen corresponding path program 1 times [2025-03-03 14:19:20,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:20,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389768228] [2025-03-03 14:19:20,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:20,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:20,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:19:20,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:19:20,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:20,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:20,326 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:20,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:20,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389768228] [2025-03-03 14:19:20,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389768228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:20,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932738681] [2025-03-03 14:19:20,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:20,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:20,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:20,328 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:19:20,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:19:20,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:19:20,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:19:20,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:20,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:20,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 1723 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:19:20,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:19:20,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:20,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932738681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:20,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:20,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:19:20,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484820837] [2025-03-03 14:19:20,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:20,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:20,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:20,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:20,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:20,661 INFO L87 Difference]: Start difference. First operand 2890 states and 4789 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 14:19:20,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:20,825 INFO L93 Difference]: Finished difference Result 8146 states and 13662 transitions. [2025-03-03 14:19:20,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:20,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-03-03 14:19:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:20,865 INFO L225 Difference]: With dead ends: 8146 [2025-03-03 14:19:20,865 INFO L226 Difference]: Without dead ends: 5301 [2025-03-03 14:19:20,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:20,884 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 886 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:20,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1813 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2025-03-03 14:19:21,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 5297. [2025-03-03 14:19:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5297 states, 4072 states have (on average 1.6446463654223968) internal successors, (6697), 4214 states have internal predecessors, (6697), 970 states have call successors, (970), 232 states have call predecessors, (970), 254 states have return successors, (1213), 947 states have call predecessors, (1213), 965 states have call successors, (1213) [2025-03-03 14:19:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5297 states to 5297 states and 8880 transitions. [2025-03-03 14:19:21,160 INFO L78 Accepts]: Start accepts. Automaton has 5297 states and 8880 transitions. Word has length 133 [2025-03-03 14:19:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:21,160 INFO L471 AbstractCegarLoop]: Abstraction has 5297 states and 8880 transitions. [2025-03-03 14:19:21,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 14:19:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 5297 states and 8880 transitions. [2025-03-03 14:19:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 14:19:21,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:21,165 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:21,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:19:21,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 14:19:21,369 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:21,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:21,370 INFO L85 PathProgramCache]: Analyzing trace with hash -991338199, now seen corresponding path program 1 times [2025-03-03 14:19:21,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:21,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418188237] [2025-03-03 14:19:21,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:21,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:21,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 14:19:21,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 14:19:21,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:21,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:21,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:21,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418188237] [2025-03-03 14:19:21,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418188237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:21,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826747628] [2025-03-03 14:19:21,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:21,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:21,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:21,492 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:19:21,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:19:21,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 14:19:21,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 14:19:21,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:21,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:21,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 1725 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:19:21,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:19:21,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:21,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826747628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:21,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:21,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:19:21,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679773502] [2025-03-03 14:19:21,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:21,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:21,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:21,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:21,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:21,793 INFO L87 Difference]: Start difference. First operand 5297 states and 8880 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 14:19:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:22,093 INFO L93 Difference]: Finished difference Result 15369 states and 26183 transitions. [2025-03-03 14:19:22,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:22,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2025-03-03 14:19:22,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:22,165 INFO L225 Difference]: With dead ends: 15369 [2025-03-03 14:19:22,166 INFO L226 Difference]: Without dead ends: 10117 [2025-03-03 14:19:22,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:22,195 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 885 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:22,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 1825 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10117 states. [2025-03-03 14:19:22,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10117 to 10112. [2025-03-03 14:19:22,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10112 states, 7767 states have (on average 1.6436204454744432) internal successors, (12766), 8037 states have internal predecessors, (12766), 1858 states have call successors, (1858), 440 states have call predecessors, (1858), 486 states have return successors, (2607), 1827 states have call predecessors, (2607), 1853 states have call successors, (2607) [2025-03-03 14:19:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10112 states to 10112 states and 17231 transitions. [2025-03-03 14:19:22,731 INFO L78 Accepts]: Start accepts. Automaton has 10112 states and 17231 transitions. Word has length 134 [2025-03-03 14:19:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:22,731 INFO L471 AbstractCegarLoop]: Abstraction has 10112 states and 17231 transitions. [2025-03-03 14:19:22,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 14:19:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 10112 states and 17231 transitions. [2025-03-03 14:19:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 14:19:22,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:22,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:22,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:19:22,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:22,939 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:22,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:22,940 INFO L85 PathProgramCache]: Analyzing trace with hash -666937671, now seen corresponding path program 1 times [2025-03-03 14:19:22,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:22,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013191315] [2025-03-03 14:19:22,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:22,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:22,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:19:22,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:19:22,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:22,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:23,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:23,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013191315] [2025-03-03 14:19:23,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013191315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:23,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689886567] [2025-03-03 14:19:23,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:23,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:23,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:23,062 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:19:23,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:19:23,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:19:23,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:19:23,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:23,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:23,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 1727 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:19:23,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:19:23,347 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:23,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689886567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:23,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:23,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:19:23,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80758950] [2025-03-03 14:19:23,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:23,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:23,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:23,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:23,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:23,349 INFO L87 Difference]: Start difference. First operand 10112 states and 17231 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 14:19:23,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:23,916 INFO L93 Difference]: Finished difference Result 29816 states and 52087 transitions. [2025-03-03 14:19:23,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:23,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2025-03-03 14:19:23,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:24,053 INFO L225 Difference]: With dead ends: 29816 [2025-03-03 14:19:24,053 INFO L226 Difference]: Without dead ends: 19741 [2025-03-03 14:19:24,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:24,101 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 883 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:24,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1853 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:24,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19741 states. [2025-03-03 14:19:24,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19741 to 19735. [2025-03-03 14:19:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19735 states, 15151 states have (on average 1.6417398191538513) internal successors, (24874), 15677 states have internal predecessors, (24874), 3634 states have call successors, (3634), 856 states have call predecessors, (3634), 949 states have return successors, (5988), 3586 states have call predecessors, (5988), 3629 states have call successors, (5988) [2025-03-03 14:19:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19735 states to 19735 states and 34496 transitions. [2025-03-03 14:19:25,010 INFO L78 Accepts]: Start accepts. Automaton has 19735 states and 34496 transitions. Word has length 135 [2025-03-03 14:19:25,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:25,011 INFO L471 AbstractCegarLoop]: Abstraction has 19735 states and 34496 transitions. [2025-03-03 14:19:25,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 14:19:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand 19735 states and 34496 transitions. [2025-03-03 14:19:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-03 14:19:25,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:25,037 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:19:25,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:19:25,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:25,237 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:25,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:25,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1643268731, now seen corresponding path program 1 times [2025-03-03 14:19:25,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:25,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63307686] [2025-03-03 14:19:25,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:25,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:25,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-03 14:19:25,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-03 14:19:25,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:25,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-03 14:19:25,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:25,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63307686] [2025-03-03 14:19:25,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63307686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:25,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830366376] [2025-03-03 14:19:25,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:25,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:25,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:25,470 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:19:25,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:19:25,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-03 14:19:25,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-03 14:19:25,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:25,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:25,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 2906 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:19:25,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-03 14:19:26,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:19:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-03 14:19:26,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830366376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:19:26,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:19:26,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 12 [2025-03-03 14:19:26,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845800117] [2025-03-03 14:19:26,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:19:26,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:19:26,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:26,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:19:26,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:19:26,795 INFO L87 Difference]: Start difference. First operand 19735 states and 34496 transitions. Second operand has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 8 states have call successors, (64), 5 states have call predecessors, (64), 9 states have return successors, (65), 9 states have call predecessors, (65), 7 states have call successors, (65) [2025-03-03 14:19:32,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:32,661 INFO L93 Difference]: Finished difference Result 72160 states and 144709 transitions. [2025-03-03 14:19:32,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:19:32,662 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 8 states have call successors, (64), 5 states have call predecessors, (64), 9 states have return successors, (65), 9 states have call predecessors, (65), 7 states have call successors, (65) Word has length 305 [2025-03-03 14:19:32,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:33,210 INFO L225 Difference]: With dead ends: 72160 [2025-03-03 14:19:33,211 INFO L226 Difference]: Without dead ends: 52470 [2025-03-03 14:19:33,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 610 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2025-03-03 14:19:33,508 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 5728 mSDsluCounter, 3515 mSDsCounter, 0 mSdLazyCounter, 7917 mSolverCounterSat, 2047 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5728 SdHoareTripleChecker+Valid, 4348 SdHoareTripleChecker+Invalid, 9964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2047 IncrementalHoareTripleChecker+Valid, 7917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:33,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5728 Valid, 4348 Invalid, 9964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2047 Valid, 7917 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-03 14:19:33,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52470 states. [2025-03-03 14:19:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52470 to 45167. [2025-03-03 14:19:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45167 states, 33463 states have (on average 1.6184143681080596) internal successors, (54157), 35077 states have internal predecessors, (54157), 9603 states have call successors, (9603), 1753 states have call predecessors, (9603), 2100 states have return successors, (18793), 9618 states have call predecessors, (18793), 9598 states have call successors, (18793) [2025-03-03 14:19:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45167 states to 45167 states and 82553 transitions. [2025-03-03 14:19:36,576 INFO L78 Accepts]: Start accepts. Automaton has 45167 states and 82553 transitions. Word has length 305 [2025-03-03 14:19:36,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:36,577 INFO L471 AbstractCegarLoop]: Abstraction has 45167 states and 82553 transitions. [2025-03-03 14:19:36,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 8 states have call successors, (64), 5 states have call predecessors, (64), 9 states have return successors, (65), 9 states have call predecessors, (65), 7 states have call successors, (65) [2025-03-03 14:19:36,578 INFO L276 IsEmpty]: Start isEmpty. Operand 45167 states and 82553 transitions. [2025-03-03 14:19:36,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 14:19:36,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:36,628 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:19:36,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:19:36,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:36,830 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:36,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:36,830 INFO L85 PathProgramCache]: Analyzing trace with hash -646521603, now seen corresponding path program 1 times [2025-03-03 14:19:36,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:36,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424984571] [2025-03-03 14:19:36,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:36,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:36,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 14:19:36,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 14:19:36,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:36,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 14:19:36,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:36,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424984571] [2025-03-03 14:19:36,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424984571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:36,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:36,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:36,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665675411] [2025-03-03 14:19:36,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:36,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:36,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:36,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:36,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:36,976 INFO L87 Difference]: Start difference. First operand 45167 states and 82553 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-03 14:19:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:40,309 INFO L93 Difference]: Finished difference Result 90614 states and 173626 transitions. [2025-03-03 14:19:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:40,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) Word has length 206 [2025-03-03 14:19:40,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:40,904 INFO L225 Difference]: With dead ends: 90614 [2025-03-03 14:19:40,904 INFO L226 Difference]: Without dead ends: 45492 [2025-03-03 14:19:41,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:41,269 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 897 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:41,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 3317 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:19:41,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45492 states. [2025-03-03 14:19:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45492 to 45492. [2025-03-03 14:19:43,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45492 states, 33723 states have (on average 1.6136464727337425) internal successors, (54417), 35337 states have internal predecessors, (54417), 9603 states have call successors, (9603), 1818 states have call predecessors, (9603), 2165 states have return successors, (18858), 9618 states have call predecessors, (18858), 9598 states have call successors, (18858) [2025-03-03 14:19:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45492 states to 45492 states and 82878 transitions. [2025-03-03 14:19:43,719 INFO L78 Accepts]: Start accepts. Automaton has 45492 states and 82878 transitions. Word has length 206 [2025-03-03 14:19:43,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:43,720 INFO L471 AbstractCegarLoop]: Abstraction has 45492 states and 82878 transitions. [2025-03-03 14:19:43,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-03 14:19:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 45492 states and 82878 transitions. [2025-03-03 14:19:43,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 14:19:43,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:43,756 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:19:43,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:19:43,756 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:43,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:43,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1661966166, now seen corresponding path program 1 times [2025-03-03 14:19:43,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:43,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4044287] [2025-03-03 14:19:43,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:43,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:43,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 14:19:43,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 14:19:43,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:43,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 14:19:43,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:43,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4044287] [2025-03-03 14:19:43,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4044287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:43,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:43,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:43,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765717553] [2025-03-03 14:19:43,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:43,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:43,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:43,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:43,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:43,923 INFO L87 Difference]: Start difference. First operand 45492 states and 82878 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-03 14:19:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:47,434 INFO L93 Difference]: Finished difference Result 91329 states and 174211 transitions. [2025-03-03 14:19:47,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:47,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) Word has length 207 [2025-03-03 14:19:47,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:48,050 INFO L225 Difference]: With dead ends: 91329 [2025-03-03 14:19:48,050 INFO L226 Difference]: Without dead ends: 45882 [2025-03-03 14:19:48,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:48,415 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 897 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:48,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 3317 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:19:48,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45882 states. [2025-03-03 14:19:49,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45882 to 45882. [2025-03-03 14:19:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45882 states, 34048 states have (on average 1.6077890037593985) internal successors, (54742), 35662 states have internal predecessors, (54742), 9603 states have call successors, (9603), 1883 states have call predecessors, (9603), 2230 states have return successors, (18923), 9618 states have call predecessors, (18923), 9598 states have call successors, (18923) [2025-03-03 14:19:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45882 states to 45882 states and 83268 transitions. [2025-03-03 14:19:50,423 INFO L78 Accepts]: Start accepts. Automaton has 45882 states and 83268 transitions. Word has length 207 [2025-03-03 14:19:50,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:50,424 INFO L471 AbstractCegarLoop]: Abstraction has 45882 states and 83268 transitions. [2025-03-03 14:19:50,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-03 14:19:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 45882 states and 83268 transitions. [2025-03-03 14:19:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-03 14:19:50,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:50,455 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:19:50,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:19:50,456 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:50,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:50,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1082012473, now seen corresponding path program 1 times [2025-03-03 14:19:50,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:50,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938629039] [2025-03-03 14:19:50,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:50,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:50,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-03 14:19:50,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-03 14:19:50,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:50,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-03-03 14:19:50,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:50,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938629039] [2025-03-03 14:19:50,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938629039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:50,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323175525] [2025-03-03 14:19:50,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:50,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:50,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:50,663 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:19:50,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:19:50,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-03 14:19:51,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-03 14:19:51,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:51,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:51,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 2916 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:19:51,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-03 14:19:51,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:19:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-03 14:19:51,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323175525] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:19:51,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:19:51,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 12 [2025-03-03 14:19:51,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541562279] [2025-03-03 14:19:51,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:19:51,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:19:51,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:51,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:19:51,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:19:51,765 INFO L87 Difference]: Start difference. First operand 45882 states and 83268 transitions. Second operand has 12 states, 12 states have (on average 22.416666666666668) internal successors, (269), 12 states have internal predecessors, (269), 8 states have call successors, (64), 5 states have call predecessors, (64), 9 states have return successors, (65), 9 states have call predecessors, (65), 7 states have call successors, (65) [2025-03-03 14:20:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:02,634 INFO L93 Difference]: Finished difference Result 184157 states and 399120 transitions. [2025-03-03 14:20:02,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:20:02,634 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 22.416666666666668) internal successors, (269), 12 states have internal predecessors, (269), 8 states have call successors, (64), 5 states have call predecessors, (64), 9 states have return successors, (65), 9 states have call predecessors, (65), 7 states have call successors, (65) Word has length 315 [2025-03-03 14:20:02,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:04,615 INFO L225 Difference]: With dead ends: 184157 [2025-03-03 14:20:04,615 INFO L226 Difference]: Without dead ends: 138320 [2025-03-03 14:20:05,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 630 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2025-03-03 14:20:05,259 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 5570 mSDsluCounter, 3595 mSDsCounter, 0 mSdLazyCounter, 7965 mSolverCounterSat, 1987 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5570 SdHoareTripleChecker+Valid, 4419 SdHoareTripleChecker+Invalid, 9952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1987 IncrementalHoareTripleChecker+Valid, 7965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:05,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5570 Valid, 4419 Invalid, 9952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1987 Valid, 7965 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 14:20:05,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138320 states. [2025-03-03 14:20:12,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138320 to 114121. [2025-03-03 14:20:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114121 states, 81008 states have (on average 1.5781033971953387) internal successors, (127839), 86142 states have internal predecessors, (127839), 27941 states have call successors, (27941), 3868 states have call predecessors, (27941), 5171 states have return successors, (64968), 28466 states have call predecessors, (64968), 27936 states have call successors, (64968) [2025-03-03 14:20:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114121 states to 114121 states and 220748 transitions. [2025-03-03 14:20:14,051 INFO L78 Accepts]: Start accepts. Automaton has 114121 states and 220748 transitions. Word has length 315 [2025-03-03 14:20:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:14,052 INFO L471 AbstractCegarLoop]: Abstraction has 114121 states and 220748 transitions. [2025-03-03 14:20:14,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.416666666666668) internal successors, (269), 12 states have internal predecessors, (269), 8 states have call successors, (64), 5 states have call predecessors, (64), 9 states have return successors, (65), 9 states have call predecessors, (65), 7 states have call successors, (65) [2025-03-03 14:20:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 114121 states and 220748 transitions. [2025-03-03 14:20:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 14:20:14,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:14,100 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 14:20:14,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 14:20:14,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:14,300 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:14,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:14,301 INFO L85 PathProgramCache]: Analyzing trace with hash 640813273, now seen corresponding path program 1 times [2025-03-03 14:20:14,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:14,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297258987] [2025-03-03 14:20:14,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:14,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 14:20:14,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 14:20:14,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:14,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 14:20:14,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297258987] [2025-03-03 14:20:14,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297258987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:14,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:14,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:20:14,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811356862] [2025-03-03 14:20:14,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:14,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:20:14,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:14,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:20:14,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:20:14,788 INFO L87 Difference]: Start difference. First operand 114121 states and 220748 transitions. Second operand has 10 states, 10 states have (on average 12.9) internal successors, (129), 8 states have internal predecessors, (129), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (26), 7 states have call predecessors, (26), 4 states have call successors, (26)