./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8090ac1e7e8284dad30217492085f9e11f6491349a4adb4aa3c2904a72e0131a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:45:01,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:45:01,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:45:01,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:45:01,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:45:01,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:45:01,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:45:01,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:45:01,368 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:45:01,368 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:45:01,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:45:01,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:45:01,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:45:01,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:45:01,368 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:45:01,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:45:01,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:45:01,368 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:45:01,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:45:01,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:45:01,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:45:01,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:45:01,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:45:01,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:45:01,369 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:45:01,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:45:01,369 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:45:01,369 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:45:01,369 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:45:01,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:45:01,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:45:01,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:45:01,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:45:01,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:45:01,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:45:01,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:45:01,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:45:01,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:45:01,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:45:01,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:45:01,371 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:45:01,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:45:01,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:45:01,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:45:01,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:45:01,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:45:01,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:45:01,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:45:01,372 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8090ac1e7e8284dad30217492085f9e11f6491349a4adb4aa3c2904a72e0131a [2025-01-09 03:45:01,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:45:01,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:45:01,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:45:01,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:45:01,616 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:45:01,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c [2025-01-09 03:45:02,738 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4539a2115/3857003db0bf4c7fa4d96fadaf2036a6/FLAG98545a999 [2025-01-09 03:45:03,036 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:45:03,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c [2025-01-09 03:45:03,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4539a2115/3857003db0bf4c7fa4d96fadaf2036a6/FLAG98545a999 [2025-01-09 03:45:03,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4539a2115/3857003db0bf4c7fa4d96fadaf2036a6 [2025-01-09 03:45:03,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:45:03,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:45:03,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:45:03,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:45:03,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:45:03,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:45:03" (1/1) ... [2025-01-09 03:45:03,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41a6878d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:03, skipping insertion in model container [2025-01-09 03:45:03,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:45:03" (1/1) ... [2025-01-09 03:45:03,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:45:03,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c[1545,1558] [2025-01-09 03:45:03,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:45:03,702 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:45:03,708 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-01-09 03:45:03,709 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [57] [2025-01-09 03:45:03,710 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [421] [2025-01-09 03:45:03,710 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1088] [2025-01-09 03:45:03,710 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1454] [2025-01-09 03:45:03,710 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1466] [2025-01-09 03:45:03,710 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1586] [2025-01-09 03:45:03,710 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1621] [2025-01-09 03:45:03,710 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3188] [2025-01-09 03:45:03,711 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [3279] [2025-01-09 03:45:03,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product22.cil.c[1545,1558] [2025-01-09 03:45:03,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:45:03,832 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:45:03,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:03 WrapperNode [2025-01-09 03:45:03,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:45:03,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:45:03,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:45:03,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:45:03,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:03" (1/1) ... [2025-01-09 03:45:03,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:03" (1/1) ... [2025-01-09 03:45:03,885 INFO L138 Inliner]: procedures = 94, calls = 345, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 872 [2025-01-09 03:45:03,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:45:03,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:45:03,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:45:03,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:45:03,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:03" (1/1) ... [2025-01-09 03:45:03,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:03" (1/1) ... [2025-01-09 03:45:03,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:03" (1/1) ... [2025-01-09 03:45:03,928 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-01-09 03:45:03,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:03" (1/1) ... [2025-01-09 03:45:03,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:03" (1/1) ... [2025-01-09 03:45:03,949 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:03" (1/1) ... [2025-01-09 03:45:03,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:03" (1/1) ... [2025-01-09 03:45:03,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:03" (1/1) ... [2025-01-09 03:45:03,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:03" (1/1) ... [2025-01-09 03:45:03,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:03" (1/1) ... [2025-01-09 03:45:03,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:45:03,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:45:04,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:45:04,000 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:45:04,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:03" (1/1) ... [2025-01-09 03:45:04,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:45:04,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:45:04,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:45:04,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:45:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:45:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:45:04,050 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:45:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-01-09 03:45:04,051 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-01-09 03:45:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:45:04,051 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:45:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:45:04,052 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:45:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:45:04,052 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:45:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:45:04,052 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:45:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:45:04,052 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:45:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-01-09 03:45:04,052 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-01-09 03:45:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:45:04,052 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:45:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:45:04,052 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:45:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:45:04,052 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:45:04,053 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-01-09 03:45:04,053 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:45:04,053 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:45:04,053 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:45:04,053 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:45:04,053 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:45:04,053 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:45:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:45:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:45:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:45:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:45:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-01-09 03:45:04,054 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-01-09 03:45:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:45:04,054 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:45:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:45:04,054 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:45:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:45:04,054 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:45:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2025-01-09 03:45:04,054 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2025-01-09 03:45:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2025-01-09 03:45:04,054 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2025-01-09 03:45:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:45:04,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:45:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:45:04,054 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:45:04,209 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:45:04,212 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:45:05,106 INFO L? ?]: Removed 450 outVars from TransFormulas that were not future-live. [2025-01-09 03:45:05,106 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:45:05,126 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:45:05,126 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:45:05,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:45:05 BoogieIcfgContainer [2025-01-09 03:45:05,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:45:05,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:45:05,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:45:05,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:45:05,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:45:03" (1/3) ... [2025-01-09 03:45:05,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2524e419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:45:05, skipping insertion in model container [2025-01-09 03:45:05,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:03" (2/3) ... [2025-01-09 03:45:05,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2524e419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:45:05, skipping insertion in model container [2025-01-09 03:45:05,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:45:05" (3/3) ... [2025-01-09 03:45:05,135 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product22.cil.c [2025-01-09 03:45:05,144 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:45:05,148 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product22.cil.c that has 26 procedures, 571 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:45:05,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:45:05,209 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;@537379f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:45:05,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:45:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 571 states, 446 states have (on average 1.6905829596412556) internal successors, (754), 469 states have internal predecessors, (754), 98 states have call successors, (98), 25 states have call predecessors, (98), 25 states have return successors, (98), 91 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 03:45:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 03:45:05,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:05,222 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] [2025-01-09 03:45:05,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:05,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:05,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1070904645, now seen corresponding path program 1 times [2025-01-09 03:45:05,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:05,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481043384] [2025-01-09 03:45:05,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:05,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:05,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 03:45:05,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 03:45:05,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:05,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:05,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:05,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481043384] [2025-01-09 03:45:05,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481043384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:05,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:05,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:05,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493149850] [2025-01-09 03:45:05,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:05,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:05,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:05,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:05,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:05,675 INFO L87 Difference]: Start difference. First operand has 571 states, 446 states have (on average 1.6905829596412556) internal successors, (754), 469 states have internal predecessors, (754), 98 states have call successors, (98), 25 states have call predecessors, (98), 25 states have return successors, (98), 91 states have call predecessors, (98), 98 states have call successors, (98) 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:05,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:05,825 INFO L93 Difference]: Finished difference Result 1122 states and 1875 transitions. [2025-01-09 03:45:05,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:05,832 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2025-01-09 03:45:05,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:05,846 INFO L225 Difference]: With dead ends: 1122 [2025-01-09 03:45:05,847 INFO L226 Difference]: Without dead ends: 563 [2025-01-09 03:45:05,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:05,858 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 5 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:05,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2786 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-01-09 03:45:05,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-01-09 03:45:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 440 states have (on average 1.6886363636363637) internal successors, (743), 461 states have internal predecessors, (743), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 03:45:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 934 transitions. [2025-01-09 03:45:05,926 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 934 transitions. Word has length 60 [2025-01-09 03:45:05,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:05,926 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 934 transitions. [2025-01-09 03:45:05,927 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:05,927 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 934 transitions. [2025-01-09 03:45:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 03:45:05,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:05,930 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-01-09 03:45:05,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:45:05,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:05,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:05,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1616029192, now seen corresponding path program 1 times [2025-01-09 03:45:05,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:05,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615789815] [2025-01-09 03:45:05,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:05,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:05,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 03:45:05,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 03:45:05,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:05,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:06,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:06,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615789815] [2025-01-09 03:45:06,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615789815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:06,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:06,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:06,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798347742] [2025-01-09 03:45:06,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:06,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:06,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:06,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:06,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:06,097 INFO L87 Difference]: Start difference. First operand 563 states and 934 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:06,170 INFO L93 Difference]: Finished difference Result 1108 states and 1845 transitions. [2025-01-09 03:45:06,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:06,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2025-01-09 03:45:06,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:06,180 INFO L225 Difference]: With dead ends: 1108 [2025-01-09 03:45:06,180 INFO L226 Difference]: Without dead ends: 563 [2025-01-09 03:45:06,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:06,183 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 4 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:06,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2765 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-01-09 03:45:06,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-01-09 03:45:06,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 440 states have (on average 1.6863636363636363) internal successors, (742), 461 states have internal predecessors, (742), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 03:45:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 933 transitions. [2025-01-09 03:45:06,216 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 933 transitions. Word has length 62 [2025-01-09 03:45:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:06,217 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 933 transitions. [2025-01-09 03:45:06,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 933 transitions. [2025-01-09 03:45:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 03:45:06,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:06,220 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] [2025-01-09 03:45:06,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:45:06,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:06,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:06,222 INFO L85 PathProgramCache]: Analyzing trace with hash -610510967, now seen corresponding path program 1 times [2025-01-09 03:45:06,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:06,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326520607] [2025-01-09 03:45:06,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:06,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:06,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 03:45:06,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 03:45:06,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:06,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:06,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:06,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326520607] [2025-01-09 03:45:06,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326520607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:06,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:06,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:06,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006547244] [2025-01-09 03:45:06,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:06,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:06,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:06,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:06,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:06,356 INFO L87 Difference]: Start difference. First operand 563 states and 933 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:06,419 INFO L93 Difference]: Finished difference Result 1108 states and 1844 transitions. [2025-01-09 03:45:06,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:06,419 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-01-09 03:45:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:06,426 INFO L225 Difference]: With dead ends: 1108 [2025-01-09 03:45:06,427 INFO L226 Difference]: Without dead ends: 563 [2025-01-09 03:45:06,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:06,432 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 3 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:06,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2765 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:06,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-01-09 03:45:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-01-09 03:45:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 440 states have (on average 1.684090909090909) internal successors, (741), 461 states have internal predecessors, (741), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 03:45:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 932 transitions. [2025-01-09 03:45:06,455 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 932 transitions. Word has length 63 [2025-01-09 03:45:06,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:06,455 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 932 transitions. [2025-01-09 03:45:06,456 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 932 transitions. [2025-01-09 03:45:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 03:45:06,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:06,458 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] [2025-01-09 03:45:06,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:45:06,458 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:06,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:06,458 INFO L85 PathProgramCache]: Analyzing trace with hash 464745500, now seen corresponding path program 1 times [2025-01-09 03:45:06,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:06,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247843802] [2025-01-09 03:45:06,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:06,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:06,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 03:45:06,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 03:45:06,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:06,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:06,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:06,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247843802] [2025-01-09 03:45:06,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247843802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:06,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:06,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:06,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14028867] [2025-01-09 03:45:06,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:06,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:06,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:06,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:06,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:06,558 INFO L87 Difference]: Start difference. First operand 563 states and 932 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:06,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:06,604 INFO L93 Difference]: Finished difference Result 1108 states and 1843 transitions. [2025-01-09 03:45:06,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:06,604 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-01-09 03:45:06,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:06,612 INFO L225 Difference]: With dead ends: 1108 [2025-01-09 03:45:06,613 INFO L226 Difference]: Without dead ends: 563 [2025-01-09 03:45:06,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:06,617 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 2 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:06,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2765 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-01-09 03:45:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-01-09 03:45:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 440 states have (on average 1.6818181818181819) internal successors, (740), 461 states have internal predecessors, (740), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 03:45:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 931 transitions. [2025-01-09 03:45:06,638 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 931 transitions. Word has length 64 [2025-01-09 03:45:06,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:06,638 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 931 transitions. [2025-01-09 03:45:06,639 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:06,639 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 931 transitions. [2025-01-09 03:45:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 03:45:06,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:06,640 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-01-09 03:45:06,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:45:06,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:06,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash -593079827, now seen corresponding path program 1 times [2025-01-09 03:45:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:06,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608365662] [2025-01-09 03:45:06,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:06,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:06,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 03:45:06,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 03:45:06,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:06,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:06,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:06,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608365662] [2025-01-09 03:45:06,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608365662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:06,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:06,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:06,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673918135] [2025-01-09 03:45:06,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:06,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:06,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:06,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:06,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:06,757 INFO L87 Difference]: Start difference. First operand 563 states and 931 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:06,795 INFO L93 Difference]: Finished difference Result 1108 states and 1842 transitions. [2025-01-09 03:45:06,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:06,796 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-01-09 03:45:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:06,800 INFO L225 Difference]: With dead ends: 1108 [2025-01-09 03:45:06,801 INFO L226 Difference]: Without dead ends: 563 [2025-01-09 03:45:06,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:06,804 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 1 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:06,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2765 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:06,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-01-09 03:45:06,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-01-09 03:45:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 440 states have (on average 1.6795454545454545) internal successors, (739), 461 states have internal predecessors, (739), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 03:45:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 930 transitions. [2025-01-09 03:45:06,829 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 930 transitions. Word has length 65 [2025-01-09 03:45:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:06,829 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 930 transitions. [2025-01-09 03:45:06,829 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 930 transitions. [2025-01-09 03:45:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 03:45:06,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:06,831 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-01-09 03:45:06,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:45:06,831 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:06,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash 943035968, now seen corresponding path program 1 times [2025-01-09 03:45:06,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:06,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685470712] [2025-01-09 03:45:06,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:06,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:06,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 03:45:06,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 03:45:06,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:06,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:06,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:06,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685470712] [2025-01-09 03:45:06,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685470712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:06,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:06,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:06,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738200956] [2025-01-09 03:45:06,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:06,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:06,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:06,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:06,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:06,991 INFO L87 Difference]: Start difference. First operand 563 states and 930 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 03:45:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:07,067 INFO L93 Difference]: Finished difference Result 1074 states and 1774 transitions. [2025-01-09 03:45:07,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:07,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-01-09 03:45:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:07,072 INFO L225 Difference]: With dead ends: 1074 [2025-01-09 03:45:07,072 INFO L226 Difference]: Without dead ends: 578 [2025-01-09 03:45:07,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:07,075 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 91 mSDsluCounter, 4519 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5439 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:07,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5439 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:07,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-01-09 03:45:07,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 576. [2025-01-09 03:45:07,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 450 states have (on average 1.6755555555555555) internal successors, (754), 473 states have internal predecessors, (754), 99 states have call successors, (99), 25 states have call predecessors, (99), 26 states have return successors, (96), 91 states have call predecessors, (96), 94 states have call successors, (96) [2025-01-09 03:45:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 949 transitions. [2025-01-09 03:45:07,101 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 949 transitions. Word has length 66 [2025-01-09 03:45:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:07,103 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 949 transitions. [2025-01-09 03:45:07,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 03:45:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 949 transitions. [2025-01-09 03:45:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 03:45:07,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:07,109 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-01-09 03:45:07,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:45:07,109 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:07,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:07,110 INFO L85 PathProgramCache]: Analyzing trace with hash 935276609, now seen corresponding path program 1 times [2025-01-09 03:45:07,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:07,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028880002] [2025-01-09 03:45:07,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:07,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:07,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 03:45:07,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 03:45:07,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:07,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:07,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:07,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028880002] [2025-01-09 03:45:07,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028880002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:07,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:07,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:07,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816046187] [2025-01-09 03:45:07,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:07,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:07,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:07,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:07,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:07,211 INFO L87 Difference]: Start difference. First operand 576 states and 949 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:07,261 INFO L93 Difference]: Finished difference Result 1126 states and 1868 transitions. [2025-01-09 03:45:07,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:07,262 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-01-09 03:45:07,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:07,266 INFO L225 Difference]: With dead ends: 1126 [2025-01-09 03:45:07,266 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 03:45:07,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:07,269 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 0 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2767 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:07,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2767 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:07,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 03:45:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-01-09 03:45:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 434 states have (on average 1.6705069124423964) internal successors, (725), 455 states have internal predecessors, (725), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 03:45:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 916 transitions. [2025-01-09 03:45:07,288 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 916 transitions. Word has length 66 [2025-01-09 03:45:07,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:07,288 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 916 transitions. [2025-01-09 03:45:07,288 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, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:07,288 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 916 transitions. [2025-01-09 03:45:07,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 03:45:07,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:07,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] [2025-01-09 03:45:07,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:45:07,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:07,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:07,291 INFO L85 PathProgramCache]: Analyzing trace with hash -295929364, now seen corresponding path program 1 times [2025-01-09 03:45:07,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:07,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789471719] [2025-01-09 03:45:07,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:07,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:07,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 03:45:07,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 03:45:07,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:07,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:07,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:07,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789471719] [2025-01-09 03:45:07,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789471719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:07,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:07,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:07,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449525866] [2025-01-09 03:45:07,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:07,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:07,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:07,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:07,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:07,426 INFO L87 Difference]: Start difference. First operand 557 states and 916 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:07,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:07,585 INFO L93 Difference]: Finished difference Result 1071 states and 1766 transitions. [2025-01-09 03:45:07,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:07,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-01-09 03:45:07,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:07,590 INFO L225 Difference]: With dead ends: 1071 [2025-01-09 03:45:07,591 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 03:45:07,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:07,593 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 55 mSDsluCounter, 3463 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4336 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:07,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4336 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:45:07,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 03:45:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 557. [2025-01-09 03:45:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 434 states have (on average 1.6612903225806452) internal successors, (721), 455 states have internal predecessors, (721), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 03:45:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 912 transitions. [2025-01-09 03:45:07,614 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 912 transitions. Word has length 67 [2025-01-09 03:45:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:07,615 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 912 transitions. [2025-01-09 03:45:07,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 912 transitions. [2025-01-09 03:45:07,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:45:07,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:07,616 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-01-09 03:45:07,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:45:07,617 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:07,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:07,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1051072189, now seen corresponding path program 1 times [2025-01-09 03:45:07,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:07,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106440426] [2025-01-09 03:45:07,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:07,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:45:07,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:45:07,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:07,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:07,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:07,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106440426] [2025-01-09 03:45:07,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106440426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:07,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:07,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:07,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984954253] [2025-01-09 03:45:07,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:07,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:07,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:07,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:07,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:07,735 INFO L87 Difference]: Start difference. First operand 557 states and 912 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:07,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:07,877 INFO L93 Difference]: Finished difference Result 1071 states and 1762 transitions. [2025-01-09 03:45:07,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:07,878 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2025-01-09 03:45:07,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:07,882 INFO L225 Difference]: With dead ends: 1071 [2025-01-09 03:45:07,882 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 03:45:07,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:07,885 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 54 mSDsluCounter, 3463 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4336 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:07,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4336 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:45:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 03:45:07,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 557. [2025-01-09 03:45:07,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 434 states have (on average 1.652073732718894) internal successors, (717), 455 states have internal predecessors, (717), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 03:45:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 908 transitions. [2025-01-09 03:45:07,904 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 908 transitions. Word has length 68 [2025-01-09 03:45:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:07,904 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 908 transitions. [2025-01-09 03:45:07,904 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 908 transitions. [2025-01-09 03:45:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 03:45:07,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:07,906 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-01-09 03:45:07,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:45:07,906 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:07,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash 478813607, now seen corresponding path program 1 times [2025-01-09 03:45:07,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:07,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86121779] [2025-01-09 03:45:07,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:07,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:07,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 03:45:07,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 03:45:07,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:07,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:08,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:08,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86121779] [2025-01-09 03:45:08,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86121779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:08,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:08,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:08,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5390444] [2025-01-09 03:45:08,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:08,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:08,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:08,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:08,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:08,002 INFO L87 Difference]: Start difference. First operand 557 states and 908 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:08,125 INFO L93 Difference]: Finished difference Result 1071 states and 1758 transitions. [2025-01-09 03:45:08,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:08,126 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2025-01-09 03:45:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:08,130 INFO L225 Difference]: With dead ends: 1071 [2025-01-09 03:45:08,130 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 03:45:08,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:08,132 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 53 mSDsluCounter, 3446 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4318 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:08,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4318 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:45:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 03:45:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 557. [2025-01-09 03:45:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 434 states have (on average 1.6428571428571428) internal successors, (713), 455 states have internal predecessors, (713), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 03:45:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 904 transitions. [2025-01-09 03:45:08,147 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 904 transitions. Word has length 69 [2025-01-09 03:45:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:08,147 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 904 transitions. [2025-01-09 03:45:08,147 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 904 transitions. [2025-01-09 03:45:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 03:45:08,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:08,149 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-01-09 03:45:08,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:45:08,149 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:08,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:08,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1941950169, now seen corresponding path program 1 times [2025-01-09 03:45:08,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:08,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192519879] [2025-01-09 03:45:08,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:08,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:08,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 03:45:08,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 03:45:08,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:08,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:08,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:08,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192519879] [2025-01-09 03:45:08,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192519879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:08,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:08,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:08,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630800692] [2025-01-09 03:45:08,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:08,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:08,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:08,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:08,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:08,259 INFO L87 Difference]: Start difference. First operand 557 states and 904 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 03:45:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:08,313 INFO L93 Difference]: Finished difference Result 1062 states and 1740 transitions. [2025-01-09 03:45:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:08,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2025-01-09 03:45:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:08,318 INFO L225 Difference]: With dead ends: 1062 [2025-01-09 03:45:08,318 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 03:45:08,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:08,321 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 84 mSDsluCounter, 4392 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5285 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:08,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5285 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:08,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 03:45:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-01-09 03:45:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 413 states have (on average 1.6440677966101696) internal successors, (679), 434 states have internal predecessors, (679), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 03:45:08,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 870 transitions. [2025-01-09 03:45:08,336 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 870 transitions. Word has length 69 [2025-01-09 03:45:08,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:08,337 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 870 transitions. [2025-01-09 03:45:08,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 03:45:08,337 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 870 transitions. [2025-01-09 03:45:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 03:45:08,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:08,338 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-01-09 03:45:08,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:45:08,338 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:08,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash 539032984, now seen corresponding path program 1 times [2025-01-09 03:45:08,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:08,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036011973] [2025-01-09 03:45:08,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:08,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:08,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 03:45:08,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 03:45:08,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:08,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:08,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:08,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036011973] [2025-01-09 03:45:08,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036011973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:08,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:08,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:08,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933516448] [2025-01-09 03:45:08,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:08,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:08,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:08,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:08,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:08,427 INFO L87 Difference]: Start difference. First operand 536 states and 870 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:08,494 INFO L93 Difference]: Finished difference Result 1041 states and 1706 transitions. [2025-01-09 03:45:08,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:08,495 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-01-09 03:45:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:08,498 INFO L225 Difference]: With dead ends: 1041 [2025-01-09 03:45:08,498 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 03:45:08,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:08,502 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 17 mSDsluCounter, 3403 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4256 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:08,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4256 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 03:45:08,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-01-09 03:45:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 413 states have (on average 1.6416464891041163) internal successors, (678), 434 states have internal predecessors, (678), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 03:45:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 869 transitions. [2025-01-09 03:45:08,517 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 869 transitions. Word has length 70 [2025-01-09 03:45:08,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:08,518 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 869 transitions. [2025-01-09 03:45:08,518 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 869 transitions. [2025-01-09 03:45:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 03:45:08,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:08,519 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-01-09 03:45:08,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:45:08,519 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:08,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:08,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1268767390, now seen corresponding path program 1 times [2025-01-09 03:45:08,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:08,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518972314] [2025-01-09 03:45:08,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:08,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:08,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 03:45:08,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 03:45:08,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:08,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:08,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:08,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518972314] [2025-01-09 03:45:08,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518972314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:08,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:08,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:08,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079247067] [2025-01-09 03:45:08,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:08,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:08,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:08,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:08,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:08,621 INFO L87 Difference]: Start difference. First operand 536 states and 869 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:08,677 INFO L93 Difference]: Finished difference Result 1041 states and 1705 transitions. [2025-01-09 03:45:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:08,678 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-01-09 03:45:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:08,681 INFO L225 Difference]: With dead ends: 1041 [2025-01-09 03:45:08,681 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 03:45:08,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:08,684 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 16 mSDsluCounter, 3403 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4256 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:08,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4256 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 03:45:08,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-01-09 03:45:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 413 states have (on average 1.639225181598063) internal successors, (677), 434 states have internal predecessors, (677), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 03:45:08,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 868 transitions. [2025-01-09 03:45:08,699 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 868 transitions. Word has length 71 [2025-01-09 03:45:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:08,699 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 868 transitions. [2025-01-09 03:45:08,699 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, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 868 transitions. [2025-01-09 03:45:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 03:45:08,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:08,700 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-01-09 03:45:08,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:45:08,700 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:08,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash -855637901, now seen corresponding path program 1 times [2025-01-09 03:45:08,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:08,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347941763] [2025-01-09 03:45:08,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:08,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:08,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 03:45:08,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 03:45:08,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:08,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:08,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:08,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347941763] [2025-01-09 03:45:08,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347941763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:08,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:08,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:08,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893009047] [2025-01-09 03:45:08,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:08,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:08,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:08,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:08,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:08,762 INFO L87 Difference]: Start difference. First operand 536 states and 868 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:08,794 INFO L93 Difference]: Finished difference Result 1035 states and 1693 transitions. [2025-01-09 03:45:08,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:08,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2025-01-09 03:45:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:08,798 INFO L225 Difference]: With dead ends: 1035 [2025-01-09 03:45:08,798 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 03:45:08,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:08,801 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 5 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:08,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2558 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 03:45:08,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-01-09 03:45:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 413 states have (on average 1.6368038740920097) internal successors, (676), 434 states have internal predecessors, (676), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 03:45:08,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 867 transitions. [2025-01-09 03:45:08,816 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 867 transitions. Word has length 72 [2025-01-09 03:45:08,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:08,817 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 867 transitions. [2025-01-09 03:45:08,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 03:45:08,817 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 867 transitions. [2025-01-09 03:45:08,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 03:45:08,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:08,818 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-01-09 03:45:08,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:45:08,818 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:08,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:08,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1023012275, now seen corresponding path program 1 times [2025-01-09 03:45:08,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:08,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528313705] [2025-01-09 03:45:08,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:08,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:08,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 03:45:08,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 03:45:08,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:08,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:09,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:09,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528313705] [2025-01-09 03:45:09,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528313705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:09,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:09,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:09,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208046053] [2025-01-09 03:45:09,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:09,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:09,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:09,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:09,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:09,015 INFO L87 Difference]: Start difference. First operand 536 states and 867 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-09 03:45:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:10,969 INFO L93 Difference]: Finished difference Result 1666 states and 2758 transitions. [2025-01-09 03:45:10,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:10,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 73 [2025-01-09 03:45:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:10,978 INFO L225 Difference]: With dead ends: 1666 [2025-01-09 03:45:10,978 INFO L226 Difference]: Without dead ends: 1175 [2025-01-09 03:45:10,981 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-01-09 03:45:10,981 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 3268 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3335 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:10,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3335 Valid, 993 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 03:45:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-01-09 03:45:11,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1053. [2025-01-09 03:45:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 818 states have (on average 1.6577017114914425) internal successors, (1356), 848 states have internal predecessors, (1356), 190 states have call successors, (190), 43 states have call predecessors, (190), 44 states have return successors, (192), 174 states have call predecessors, (192), 185 states have call successors, (192) [2025-01-09 03:45:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1738 transitions. [2025-01-09 03:45:11,028 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1738 transitions. Word has length 73 [2025-01-09 03:45:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:11,028 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1738 transitions. [2025-01-09 03:45:11,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-09 03:45:11,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1738 transitions. [2025-01-09 03:45:11,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:45:11,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:11,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:11,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:45:11,032 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:11,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:11,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1183687653, now seen corresponding path program 1 times [2025-01-09 03:45:11,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:11,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606006088] [2025-01-09 03:45:11,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:11,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:11,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:45:11,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:45:11,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:11,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:11,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:11,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606006088] [2025-01-09 03:45:11,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606006088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:11,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:11,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:45:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9186532] [2025-01-09 03:45:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:11,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:45:11,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:11,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:45:11,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:11,350 INFO L87 Difference]: Start difference. First operand 1053 states and 1738 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:45:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:12,767 INFO L93 Difference]: Finished difference Result 2069 states and 3478 transitions. [2025-01-09 03:45:12,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:45:12,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 112 [2025-01-09 03:45:12,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:12,774 INFO L225 Difference]: With dead ends: 2069 [2025-01-09 03:45:12,774 INFO L226 Difference]: Without dead ends: 1061 [2025-01-09 03:45:12,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:45:12,779 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1313 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:12,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 1606 Invalid, 3147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 03:45:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-01-09 03:45:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1061. [2025-01-09 03:45:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 824 states have (on average 1.6529126213592233) internal successors, (1362), 854 states have internal predecessors, (1362), 190 states have call successors, (190), 43 states have call predecessors, (190), 46 states have return successors, (224), 176 states have call predecessors, (224), 185 states have call successors, (224) [2025-01-09 03:45:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1776 transitions. [2025-01-09 03:45:12,830 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1776 transitions. Word has length 112 [2025-01-09 03:45:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:12,831 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1776 transitions. [2025-01-09 03:45:12,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:45:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1776 transitions. [2025-01-09 03:45:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:45:12,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:12,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:12,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:45:12,849 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:12,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:12,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2091954086, now seen corresponding path program 1 times [2025-01-09 03:45:12,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:12,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474742219] [2025-01-09 03:45:12,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:12,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:12,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:45:12,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:45:12,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:12,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:13,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:13,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474742219] [2025-01-09 03:45:13,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474742219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:13,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:13,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 03:45:13,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346901149] [2025-01-09 03:45:13,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:13,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 03:45:13,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:13,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 03:45:13,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:45:13,166 INFO L87 Difference]: Start difference. First operand 1061 states and 1776 transitions. Second operand has 14 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 03:45:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:18,132 INFO L93 Difference]: Finished difference Result 3886 states and 6545 transitions. [2025-01-09 03:45:18,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 03:45:18,133 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 112 [2025-01-09 03:45:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:18,148 INFO L225 Difference]: With dead ends: 3886 [2025-01-09 03:45:18,148 INFO L226 Difference]: Without dead ends: 2870 [2025-01-09 03:45:18,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 03:45:18,154 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 2271 mSDsluCounter, 6582 mSDsCounter, 0 mSdLazyCounter, 13268 mSolverCounterSat, 626 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2349 SdHoareTripleChecker+Valid, 7341 SdHoareTripleChecker+Invalid, 13894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 626 IncrementalHoareTripleChecker+Valid, 13268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:18,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2349 Valid, 7341 Invalid, 13894 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [626 Valid, 13268 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 03:45:18,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2025-01-09 03:45:18,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2772. [2025-01-09 03:45:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2772 states, 2083 states have (on average 1.6207393182909267) internal successors, (3376), 2159 states have internal predecessors, (3376), 566 states have call successors, (566), 99 states have call predecessors, (566), 122 states have return successors, (665), 546 states have call predecessors, (665), 561 states have call successors, (665) [2025-01-09 03:45:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 4607 transitions. [2025-01-09 03:45:18,289 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 4607 transitions. Word has length 112 [2025-01-09 03:45:18,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:18,290 INFO L471 AbstractCegarLoop]: Abstraction has 2772 states and 4607 transitions. [2025-01-09 03:45:18,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 03:45:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 4607 transitions. [2025-01-09 03:45:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:45:18,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:18,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:18,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:45:18,293 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:18,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:18,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1642108273, now seen corresponding path program 1 times [2025-01-09 03:45:18,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:18,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25496817] [2025-01-09 03:45:18,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:18,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:18,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:45:18,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:45:18,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:18,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:18,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:18,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25496817] [2025-01-09 03:45:18,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25496817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:18,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:18,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:18,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991780864] [2025-01-09 03:45:18,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:18,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:18,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:18,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:18,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:18,469 INFO L87 Difference]: Start difference. First operand 2772 states and 4607 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:45:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:20,635 INFO L93 Difference]: Finished difference Result 8897 states and 15164 transitions. [2025-01-09 03:45:20,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 03:45:20,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 113 [2025-01-09 03:45:20,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:20,665 INFO L225 Difference]: With dead ends: 8897 [2025-01-09 03:45:20,665 INFO L226 Difference]: Without dead ends: 6170 [2025-01-09 03:45:20,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-01-09 03:45:20,679 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 2759 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 4528 mSolverCounterSat, 740 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2839 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 5268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 740 IncrementalHoareTripleChecker+Valid, 4528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:20,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2839 Valid, 2522 Invalid, 5268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [740 Valid, 4528 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 03:45:20,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6170 states. [2025-01-09 03:45:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6170 to 5935. [2025-01-09 03:45:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5935 states, 4461 states have (on average 1.6112979152656355) internal successors, (7188), 4642 states have internal predecessors, (7188), 1204 states have call successors, (1204), 237 states have call predecessors, (1204), 269 states have return successors, (1389), 1132 states have call predecessors, (1389), 1199 states have call successors, (1389) [2025-01-09 03:45:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5935 states to 5935 states and 9781 transitions. [2025-01-09 03:45:20,966 INFO L78 Accepts]: Start accepts. Automaton has 5935 states and 9781 transitions. Word has length 113 [2025-01-09 03:45:20,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:20,966 INFO L471 AbstractCegarLoop]: Abstraction has 5935 states and 9781 transitions. [2025-01-09 03:45:20,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:45:20,966 INFO L276 IsEmpty]: Start isEmpty. Operand 5935 states and 9781 transitions. [2025-01-09 03:45:20,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:45:20,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:20,970 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:20,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:45:20,970 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:20,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:20,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1152799461, now seen corresponding path program 1 times [2025-01-09 03:45:20,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:20,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804982700] [2025-01-09 03:45:20,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:20,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:20,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:45:20,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:45:20,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:21,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:45:21,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:21,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804982700] [2025-01-09 03:45:21,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804982700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:21,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:21,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:21,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338725203] [2025-01-09 03:45:21,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:21,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:21,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:21,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:21,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:21,120 INFO L87 Difference]: Start difference. First operand 5935 states and 9781 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:45:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:23,442 INFO L93 Difference]: Finished difference Result 16869 states and 28269 transitions. [2025-01-09 03:45:23,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:23,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 115 [2025-01-09 03:45:23,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:23,493 INFO L225 Difference]: With dead ends: 16869 [2025-01-09 03:45:23,493 INFO L226 Difference]: Without dead ends: 10975 [2025-01-09 03:45:23,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:45:23,518 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 3260 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 3318 mSolverCounterSat, 881 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3296 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 4199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 881 IncrementalHoareTripleChecker+Valid, 3318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:23,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3296 Valid, 1827 Invalid, 4199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [881 Valid, 3318 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 03:45:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10975 states. [2025-01-09 03:45:23,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10975 to 9480. [2025-01-09 03:45:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9480 states, 6980 states have (on average 1.5974212034383954) internal successors, (11150), 7318 states have internal predecessors, (11150), 2070 states have call successors, (2070), 360 states have call predecessors, (2070), 429 states have return successors, (2408), 1997 states have call predecessors, (2408), 2065 states have call successors, (2408) [2025-01-09 03:45:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9480 states to 9480 states and 15628 transitions. [2025-01-09 03:45:24,023 INFO L78 Accepts]: Start accepts. Automaton has 9480 states and 15628 transitions. Word has length 115 [2025-01-09 03:45:24,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:24,025 INFO L471 AbstractCegarLoop]: Abstraction has 9480 states and 15628 transitions. [2025-01-09 03:45:24,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:45:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 9480 states and 15628 transitions. [2025-01-09 03:45:24,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:45:24,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:24,028 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:24,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:45:24,029 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:24,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:24,029 INFO L85 PathProgramCache]: Analyzing trace with hash 218925967, now seen corresponding path program 1 times [2025-01-09 03:45:24,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:24,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026328192] [2025-01-09 03:45:24,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:24,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:24,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:45:24,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:45:24,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:24,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:45:24,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:24,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026328192] [2025-01-09 03:45:24,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026328192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:24,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:24,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:24,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117103840] [2025-01-09 03:45:24,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:24,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:24,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:24,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:24,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:24,175 INFO L87 Difference]: Start difference. First operand 9480 states and 15628 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:45:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:26,926 INFO L93 Difference]: Finished difference Result 30662 states and 51746 transitions. [2025-01-09 03:45:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:26,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 116 [2025-01-09 03:45:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:27,022 INFO L225 Difference]: With dead ends: 30662 [2025-01-09 03:45:27,022 INFO L226 Difference]: Without dead ends: 21230 [2025-01-09 03:45:27,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:45:27,055 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 3273 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 3279 mSolverCounterSat, 905 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3310 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 4184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 905 IncrementalHoareTripleChecker+Valid, 3279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:27,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3310 Valid, 1840 Invalid, 4184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [905 Valid, 3279 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 03:45:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21230 states. [2025-01-09 03:45:27,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21230 to 18342. [2025-01-09 03:45:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18342 states, 13174 states have (on average 1.584332776681342) internal successors, (20872), 13912 states have internal predecessors, (20872), 4359 states have call successors, (4359), 608 states have call predecessors, (4359), 808 states have return successors, (5177), 4318 states have call predecessors, (5177), 4354 states have call successors, (5177) [2025-01-09 03:45:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18342 states to 18342 states and 30408 transitions. [2025-01-09 03:45:28,126 INFO L78 Accepts]: Start accepts. Automaton has 18342 states and 30408 transitions. Word has length 116 [2025-01-09 03:45:28,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:28,126 INFO L471 AbstractCegarLoop]: Abstraction has 18342 states and 30408 transitions. [2025-01-09 03:45:28,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:45:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 18342 states and 30408 transitions. [2025-01-09 03:45:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:45:28,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:28,130 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:28,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:45:28,130 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:28,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:28,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1829027914, now seen corresponding path program 1 times [2025-01-09 03:45:28,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:28,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816000757] [2025-01-09 03:45:28,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:28,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:28,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:45:28,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:45:28,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:28,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:45:28,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:28,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816000757] [2025-01-09 03:45:28,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816000757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:28,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:28,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:28,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804980491] [2025-01-09 03:45:28,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:28,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:28,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:28,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:28,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:28,288 INFO L87 Difference]: Start difference. First operand 18342 states and 30408 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:45:32,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:32,365 INFO L93 Difference]: Finished difference Result 67273 states and 114517 transitions. [2025-01-09 03:45:32,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:32,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 117 [2025-01-09 03:45:32,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:32,674 INFO L225 Difference]: With dead ends: 67273 [2025-01-09 03:45:32,674 INFO L226 Difference]: Without dead ends: 48981 [2025-01-09 03:45:32,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:45:32,772 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 3285 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 3288 mSolverCounterSat, 907 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3323 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 4195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 907 IncrementalHoareTripleChecker+Valid, 3288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:32,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3323 Valid, 1861 Invalid, 4195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [907 Valid, 3288 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 03:45:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48981 states. [2025-01-09 03:45:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48981 to 41630. [2025-01-09 03:45:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41630 states, 29256 states have (on average 1.5765313098167897) internal successors, (46123), 31052 states have internal predecessors, (46123), 10614 states have call successors, (10614), 1104 states have call predecessors, (10614), 1759 states have return successors, (12976), 10747 states have call predecessors, (12976), 10609 states have call successors, (12976) [2025-01-09 03:45:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41630 states to 41630 states and 69713 transitions. [2025-01-09 03:45:35,937 INFO L78 Accepts]: Start accepts. Automaton has 41630 states and 69713 transitions. Word has length 117 [2025-01-09 03:45:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:35,938 INFO L471 AbstractCegarLoop]: Abstraction has 41630 states and 69713 transitions. [2025-01-09 03:45:35,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:45:35,938 INFO L276 IsEmpty]: Start isEmpty. Operand 41630 states and 69713 transitions. [2025-01-09 03:45:35,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:45:35,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:35,941 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:35,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:45:35,942 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:35,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:35,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1782109322, now seen corresponding path program 1 times [2025-01-09 03:45:35,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:35,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502499615] [2025-01-09 03:45:35,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:35,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:35,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:45:35,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:45:35,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:35,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:45:36,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:36,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502499615] [2025-01-09 03:45:36,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502499615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:36,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:36,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:36,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720791543] [2025-01-09 03:45:36,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:36,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:36,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:36,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:36,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:36,085 INFO L87 Difference]: Start difference. First operand 41630 states and 69713 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:45:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:45,768 INFO L93 Difference]: Finished difference Result 169024 states and 290469 transitions. [2025-01-09 03:45:45,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:45,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 118 [2025-01-09 03:45:45,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:46,593 INFO L225 Difference]: With dead ends: 169024 [2025-01-09 03:45:46,593 INFO L226 Difference]: Without dead ends: 127448 [2025-01-09 03:45:46,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:45:46,890 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 3297 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 3297 mSolverCounterSat, 909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3336 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 4206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 909 IncrementalHoareTripleChecker+Valid, 3297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:46,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3336 Valid, 1882 Invalid, 4206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [909 Valid, 3297 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 03:45:46,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127448 states. [2025-01-09 03:45:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127448 to 105838. [2025-01-09 03:45:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105838 states, 73348 states have (on average 1.5736761738561378) internal successors, (115426), 78028 states have internal predecessors, (115426), 28189 states have call successors, (28189), 2096 states have call predecessors, (28189), 4300 states have return successors, (35557), 29024 states have call predecessors, (35557), 28184 states have call successors, (35557) [2025-01-09 03:45:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105838 states to 105838 states and 179172 transitions. [2025-01-09 03:45:54,693 INFO L78 Accepts]: Start accepts. Automaton has 105838 states and 179172 transitions. Word has length 118 [2025-01-09 03:45:54,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:54,693 INFO L471 AbstractCegarLoop]: Abstraction has 105838 states and 179172 transitions. [2025-01-09 03:45:54,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:45:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 105838 states and 179172 transitions. [2025-01-09 03:45:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:45:54,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:54,697 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:54,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:45:54,697 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:54,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:54,697 INFO L85 PathProgramCache]: Analyzing trace with hash 436444753, now seen corresponding path program 1 times [2025-01-09 03:45:54,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:54,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464654348] [2025-01-09 03:45:54,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:54,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:54,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:45:54,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:45:54,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:54,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:45:54,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:54,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464654348] [2025-01-09 03:45:54,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464654348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:54,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:54,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:54,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504637162] [2025-01-09 03:45:54,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:54,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:54,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:54,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:54,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:54,810 INFO L87 Difference]: Start difference. First operand 105838 states and 179172 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13)