./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_product26.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 d5d3c0f581b3d52ccfb3e43d6fb6458a66cd40c307750c0d7336040b60b78e76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:47:56,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:47:56,895 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:47:56,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:47:56,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:47:56,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:47:56,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:47:56,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:47:56,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:47:56,929 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:47:56,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:47:56,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:47:56,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:47:56,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:47:56,929 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:47:56,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:47:56,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:47:56,929 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:47:56,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:47:56,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:47:56,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:47:56,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:47:56,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:47:56,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:47:56,931 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:47:56,932 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:47:56,932 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:47:56,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:47:56,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:47:56,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:47:56,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:47:56,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:47:56,933 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 -> d5d3c0f581b3d52ccfb3e43d6fb6458a66cd40c307750c0d7336040b60b78e76 [2025-01-09 03:47:57,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:47:57,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:47:57,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:47:57,190 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:47:57,190 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:47:57,191 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c [2025-01-09 03:47:58,377 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2fb1ed76/2dd5f8e145694b82b71c798dbc97987e/FLAG440f353f5 [2025-01-09 03:47:58,716 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:47:58,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c [2025-01-09 03:47:58,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2fb1ed76/2dd5f8e145694b82b71c798dbc97987e/FLAG440f353f5 [2025-01-09 03:47:58,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2fb1ed76/2dd5f8e145694b82b71c798dbc97987e [2025-01-09 03:47:58,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:47:58,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:47:58,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:47:58,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:47:58,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:47:58,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:47:58" (1/1) ... [2025-01-09 03:47:58,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28213580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:58, skipping insertion in model container [2025-01-09 03:47:58,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:47:58" (1/1) ... [2025-01-09 03:47:58,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:47:59,150 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c[46529,46542] [2025-01-09 03:47:59,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:47:59,231 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:47:59,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-01-09 03:47:59,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [414] [2025-01-09 03:47:59,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [428] [2025-01-09 03:47:59,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [594] [2025-01-09 03:47:59,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2119] [2025-01-09 03:47:59,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2128] [2025-01-09 03:47:59,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2790] [2025-01-09 03:47:59,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3145] [2025-01-09 03:47:59,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3236] [2025-01-09 03:47:59,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3271] [2025-01-09 03:47:59,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c[46529,46542] [2025-01-09 03:47:59,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:47:59,383 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:47:59,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:59 WrapperNode [2025-01-09 03:47:59,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:47:59,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:47:59,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:47:59,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:47:59,391 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:47:59" (1/1) ... [2025-01-09 03:47:59,420 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:47:59" (1/1) ... [2025-01-09 03:47:59,466 INFO L138 Inliner]: procedures = 93, calls = 337, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 810 [2025-01-09 03:47:59,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:47:59,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:47:59,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:47:59,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:47:59,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:59" (1/1) ... [2025-01-09 03:47:59,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:59" (1/1) ... [2025-01-09 03:47:59,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:59" (1/1) ... [2025-01-09 03:47:59,519 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:47:59,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:59" (1/1) ... [2025-01-09 03:47:59,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:59" (1/1) ... [2025-01-09 03:47:59,538 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:59" (1/1) ... [2025-01-09 03:47:59,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:59" (1/1) ... [2025-01-09 03:47:59,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:59" (1/1) ... [2025-01-09 03:47:59,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:59" (1/1) ... [2025-01-09 03:47:59,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:59" (1/1) ... [2025-01-09 03:47:59,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:47:59,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:47:59,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:47:59,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:47:59,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:59" (1/1) ... [2025-01-09 03:47:59,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:47:59,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:59,610 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:47:59,616 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:47:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:47:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:47:59,633 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:47:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-01-09 03:47:59,634 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-01-09 03:47:59,634 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:47:59,634 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:47:59,634 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:47:59,634 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:47:59,634 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:47:59,634 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:47:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:47:59,635 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:47:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:47:59,635 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:47:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-01-09 03:47:59,635 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-01-09 03:47:59,635 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:47:59,636 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:47:59,636 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:47:59,636 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:47:59,636 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:47:59,636 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:47:59,636 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:47:59,637 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:47:59,637 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:47:59,637 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:47:59,637 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:47:59,637 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:47:59,637 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2025-01-09 03:47:59,637 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2025-01-09 03:47:59,637 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:47:59,637 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:47:59,637 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:47:59,637 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:47:59,637 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:47:59,637 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:47:59,637 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-01-09 03:47:59,638 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:47:59,638 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:47:59,638 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:47:59,638 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:47:59,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:47:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:47:59,638 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:47:59,793 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:47:59,795 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:48:00,816 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2025-01-09 03:48:00,817 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:48:00,832 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:48:00,832 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:48:00,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:00 BoogieIcfgContainer [2025-01-09 03:48:00,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:48:00,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:48:00,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:48:00,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:48:00,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:47:58" (1/3) ... [2025-01-09 03:48:00,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141b394d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:00, skipping insertion in model container [2025-01-09 03:48:00,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:59" (2/3) ... [2025-01-09 03:48:00,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141b394d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:00, skipping insertion in model container [2025-01-09 03:48:00,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:00" (3/3) ... [2025-01-09 03:48:00,843 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product26.cil.c [2025-01-09 03:48:00,853 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:48:00,856 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product26.cil.c that has 24 procedures, 544 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:48:00,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:48:00,925 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;@677a80cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:48:00,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:48:00,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 544 states, 430 states have (on average 1.7069767441860466) internal successors, (734), 453 states have internal predecessors, (734), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (89), 82 states have call predecessors, (89), 89 states have call successors, (89) [2025-01-09 03:48:00,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 03:48:00,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:00,944 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] [2025-01-09 03:48:00,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:00,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:00,948 INFO L85 PathProgramCache]: Analyzing trace with hash -372992275, now seen corresponding path program 1 times [2025-01-09 03:48:00,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:00,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330161371] [2025-01-09 03:48:00,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:00,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:01,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 03:48:01,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 03:48:01,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:01,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:01,398 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:48:01,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:01,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330161371] [2025-01-09 03:48:01,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330161371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:01,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:01,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:01,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391608436] [2025-01-09 03:48:01,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:01,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:01,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:01,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:01,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:01,425 INFO L87 Difference]: Start difference. First operand has 544 states, 430 states have (on average 1.7069767441860466) internal successors, (734), 453 states have internal predecessors, (734), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (89), 82 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:48:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:01,555 INFO L93 Difference]: Finished difference Result 1068 states and 1799 transitions. [2025-01-09 03:48:01,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:01,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 58 [2025-01-09 03:48:01,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:01,568 INFO L225 Difference]: With dead ends: 1068 [2025-01-09 03:48:01,568 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 03:48:01,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:01,576 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 5 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:01,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2672 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 03:48:01,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-01-09 03:48:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 424 states have (on average 1.705188679245283) internal successors, (723), 445 states have internal predecessors, (723), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 03:48:01,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 896 transitions. [2025-01-09 03:48:01,647 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 896 transitions. Word has length 58 [2025-01-09 03:48:01,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:01,648 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 896 transitions. [2025-01-09 03:48:01,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:48:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 896 transitions. [2025-01-09 03:48:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 03:48:01,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:01,652 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:48:01,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:48:01,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:01,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:01,653 INFO L85 PathProgramCache]: Analyzing trace with hash 183158382, now seen corresponding path program 1 times [2025-01-09 03:48:01,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:01,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194863198] [2025-01-09 03:48:01,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:01,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:01,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 03:48:01,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 03:48:01,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:01,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:01,823 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:48:01,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:01,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194863198] [2025-01-09 03:48:01,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194863198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:01,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:01,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:01,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075408996] [2025-01-09 03:48:01,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:01,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:01,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:01,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:01,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:01,825 INFO L87 Difference]: Start difference. First operand 536 states and 896 transitions. 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:48:01,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:01,906 INFO L93 Difference]: Finished difference Result 1054 states and 1769 transitions. [2025-01-09 03:48:01,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:01,907 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:48:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:01,914 INFO L225 Difference]: With dead ends: 1054 [2025-01-09 03:48:01,914 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 03:48:01,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:01,919 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 4 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:01,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2651 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:01,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 03:48:01,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-01-09 03:48:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 424 states have (on average 1.7028301886792452) internal successors, (722), 445 states have internal predecessors, (722), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 03:48:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 895 transitions. [2025-01-09 03:48:01,948 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 895 transitions. Word has length 60 [2025-01-09 03:48:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:01,948 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 895 transitions. [2025-01-09 03:48:01,948 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:48:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 895 transitions. [2025-01-09 03:48:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 03:48:01,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:01,950 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] [2025-01-09 03:48:01,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:48:01,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:01,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1710441566, now seen corresponding path program 1 times [2025-01-09 03:48:01,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:01,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983661638] [2025-01-09 03:48:01,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:01,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:01,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 03:48:01,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 03:48:01,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:01,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:02,082 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:48:02,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:02,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983661638] [2025-01-09 03:48:02,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983661638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:02,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:02,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:02,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59822677] [2025-01-09 03:48:02,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:02,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:02,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:02,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:02,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:02,085 INFO L87 Difference]: Start difference. First operand 536 states and 895 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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:48:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:02,138 INFO L93 Difference]: Finished difference Result 1054 states and 1768 transitions. [2025-01-09 03:48:02,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:02,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 61 [2025-01-09 03:48:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:02,142 INFO L225 Difference]: With dead ends: 1054 [2025-01-09 03:48:02,143 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 03:48:02,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:02,145 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 3 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:02,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2651 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:02,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 03:48:02,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-01-09 03:48:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 424 states have (on average 1.7004716981132075) internal successors, (721), 445 states have internal predecessors, (721), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 03:48:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 894 transitions. [2025-01-09 03:48:02,176 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 894 transitions. Word has length 61 [2025-01-09 03:48:02,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:02,176 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 894 transitions. [2025-01-09 03:48:02,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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:48:02,177 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 894 transitions. [2025-01-09 03:48:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 03:48:02,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:02,179 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:48:02,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:48:02,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:02,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:02,180 INFO L85 PathProgramCache]: Analyzing trace with hash -988674574, now seen corresponding path program 1 times [2025-01-09 03:48:02,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:02,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881992603] [2025-01-09 03:48:02,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:02,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:02,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 03:48:02,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 03:48:02,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:02,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:02,312 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:48:02,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:02,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881992603] [2025-01-09 03:48:02,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881992603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:02,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:02,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:02,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254508856] [2025-01-09 03:48:02,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:02,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:02,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:02,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:02,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:02,314 INFO L87 Difference]: Start difference. First operand 536 states and 894 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:48:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:02,365 INFO L93 Difference]: Finished difference Result 1054 states and 1767 transitions. [2025-01-09 03:48:02,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:02,366 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:48:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:02,371 INFO L225 Difference]: With dead ends: 1054 [2025-01-09 03:48:02,371 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 03:48:02,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:02,377 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 2 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:02,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2651 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:02,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 03:48:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-01-09 03:48:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 424 states have (on average 1.6981132075471699) internal successors, (720), 445 states have internal predecessors, (720), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 03:48:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 893 transitions. [2025-01-09 03:48:02,395 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 893 transitions. Word has length 62 [2025-01-09 03:48:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:02,397 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 893 transitions. [2025-01-09 03:48:02,397 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:48:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 893 transitions. [2025-01-09 03:48:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 03:48:02,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:02,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:02,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:48:02,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:02,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:02,401 INFO L85 PathProgramCache]: Analyzing trace with hash -794911066, now seen corresponding path program 1 times [2025-01-09 03:48:02,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:02,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753500624] [2025-01-09 03:48:02,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:02,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:02,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 03:48:02,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 03:48:02,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:02,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:02,545 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:48:02,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:02,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753500624] [2025-01-09 03:48:02,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753500624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:02,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:02,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:02,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948792575] [2025-01-09 03:48:02,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:02,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:02,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:02,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:02,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:02,549 INFO L87 Difference]: Start difference. First operand 536 states and 893 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:48:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:02,588 INFO L93 Difference]: Finished difference Result 1054 states and 1766 transitions. [2025-01-09 03:48:02,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:02,588 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:48:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:02,593 INFO L225 Difference]: With dead ends: 1054 [2025-01-09 03:48:02,593 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 03:48:02,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:02,596 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 1 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:02,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2651 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:02,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 03:48:02,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-01-09 03:48:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 424 states have (on average 1.695754716981132) internal successors, (719), 445 states have internal predecessors, (719), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 03:48:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 892 transitions. [2025-01-09 03:48:02,619 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 892 transitions. Word has length 63 [2025-01-09 03:48:02,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:02,620 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 892 transitions. [2025-01-09 03:48:02,620 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:48:02,620 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 892 transitions. [2025-01-09 03:48:02,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 03:48:02,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:02,621 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:48:02,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:48:02,622 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:02,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:02,622 INFO L85 PathProgramCache]: Analyzing trace with hash 210613622, now seen corresponding path program 1 times [2025-01-09 03:48:02,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:02,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021331394] [2025-01-09 03:48:02,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:02,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:02,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 03:48:02,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 03:48:02,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:02,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:02,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:02,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021331394] [2025-01-09 03:48:02,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021331394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:02,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:02,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:02,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212213984] [2025-01-09 03:48:02,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:02,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:02,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:02,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:02,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:02,801 INFO L87 Difference]: Start difference. First operand 536 states and 892 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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:48:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:02,902 INFO L93 Difference]: Finished difference Result 1020 states and 1698 transitions. [2025-01-09 03:48:02,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:02,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 64 [2025-01-09 03:48:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:02,906 INFO L225 Difference]: With dead ends: 1020 [2025-01-09 03:48:02,907 INFO L226 Difference]: Without dead ends: 551 [2025-01-09 03:48:02,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:02,909 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 91 mSDsluCounter, 4329 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5211 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:02,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5211 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-01-09 03:48:02,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2025-01-09 03:48:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 434 states have (on average 1.6912442396313363) internal successors, (734), 457 states have internal predecessors, (734), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2025-01-09 03:48:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 911 transitions. [2025-01-09 03:48:02,929 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 911 transitions. Word has length 64 [2025-01-09 03:48:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:02,930 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 911 transitions. [2025-01-09 03:48:02,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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:48:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 911 transitions. [2025-01-09 03:48:02,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 03:48:02,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:02,932 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:48:02,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:48:02,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:02,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:02,932 INFO L85 PathProgramCache]: Analyzing trace with hash -2113414217, now seen corresponding path program 1 times [2025-01-09 03:48:02,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:02,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254770079] [2025-01-09 03:48:02,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:02,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:02,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 03:48:02,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 03:48:02,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:02,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:03,007 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:48:03,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:03,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254770079] [2025-01-09 03:48:03,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254770079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:03,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:03,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:03,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208493688] [2025-01-09 03:48:03,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:03,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:03,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:03,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:03,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:03,010 INFO L87 Difference]: Start difference. First operand 549 states and 911 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:48:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:03,040 INFO L93 Difference]: Finished difference Result 1072 states and 1792 transitions. [2025-01-09 03:48:03,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:03,040 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:48:03,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:03,044 INFO L225 Difference]: With dead ends: 1072 [2025-01-09 03:48:03,044 INFO L226 Difference]: Without dead ends: 530 [2025-01-09 03:48:03,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:03,046 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 0 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2653 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:03,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2653 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:03,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-01-09 03:48:03,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-01-09 03:48:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 418 states have (on average 1.686602870813397) internal successors, (705), 439 states have internal predecessors, (705), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 03:48:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 878 transitions. [2025-01-09 03:48:03,065 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 878 transitions. Word has length 64 [2025-01-09 03:48:03,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:03,065 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 878 transitions. [2025-01-09 03:48:03,065 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:48:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 878 transitions. [2025-01-09 03:48:03,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 03:48:03,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:03,067 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:48:03,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:48:03,067 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:03,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:03,068 INFO L85 PathProgramCache]: Analyzing trace with hash 255674940, now seen corresponding path program 1 times [2025-01-09 03:48:03,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:03,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354073239] [2025-01-09 03:48:03,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:03,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:03,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 03:48:03,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 03:48:03,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:03,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:03,207 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:48:03,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:03,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354073239] [2025-01-09 03:48:03,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354073239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:03,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:03,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:03,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999074635] [2025-01-09 03:48:03,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:03,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:03,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:03,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:03,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:03,209 INFO L87 Difference]: Start difference. First operand 530 states and 878 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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:48:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:03,368 INFO L93 Difference]: Finished difference Result 1017 states and 1690 transitions. [2025-01-09 03:48:03,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:03,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2025-01-09 03:48:03,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:03,373 INFO L225 Difference]: With dead ends: 1017 [2025-01-09 03:48:03,373 INFO L226 Difference]: Without dead ends: 539 [2025-01-09 03:48:03,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:03,375 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 55 mSDsluCounter, 3311 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4146 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:03,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4146 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-01-09 03:48:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 530. [2025-01-09 03:48:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 418 states have (on average 1.6770334928229664) internal successors, (701), 439 states have internal predecessors, (701), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 03:48:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 874 transitions. [2025-01-09 03:48:03,394 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 874 transitions. Word has length 65 [2025-01-09 03:48:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:03,394 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 874 transitions. [2025-01-09 03:48:03,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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:48:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 874 transitions. [2025-01-09 03:48:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 03:48:03,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:03,396 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:48:03,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:48:03,396 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:03,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:03,397 INFO L85 PathProgramCache]: Analyzing trace with hash 447018099, now seen corresponding path program 1 times [2025-01-09 03:48:03,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:03,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860512717] [2025-01-09 03:48:03,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:03,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:03,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 03:48:03,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 03:48:03,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:03,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:03,510 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:48:03,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:03,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860512717] [2025-01-09 03:48:03,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860512717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:03,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:03,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:03,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301175348] [2025-01-09 03:48:03,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:03,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:03,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:03,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:03,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:03,512 INFO L87 Difference]: Start difference. First operand 530 states and 874 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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:48:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:03,650 INFO L93 Difference]: Finished difference Result 1017 states and 1686 transitions. [2025-01-09 03:48:03,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:03,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 66 [2025-01-09 03:48:03,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:03,655 INFO L225 Difference]: With dead ends: 1017 [2025-01-09 03:48:03,655 INFO L226 Difference]: Without dead ends: 539 [2025-01-09 03:48:03,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:03,658 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 54 mSDsluCounter, 3311 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4146 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:03,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4146 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-01-09 03:48:03,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 530. [2025-01-09 03:48:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 418 states have (on average 1.667464114832536) internal successors, (697), 439 states have internal predecessors, (697), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 03:48:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 870 transitions. [2025-01-09 03:48:03,673 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 870 transitions. Word has length 66 [2025-01-09 03:48:03,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:03,674 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 870 transitions. [2025-01-09 03:48:03,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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:48:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 870 transitions. [2025-01-09 03:48:03,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 03:48:03,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:03,675 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:48:03,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:48:03,675 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:03,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:03,675 INFO L85 PathProgramCache]: Analyzing trace with hash 801654135, now seen corresponding path program 1 times [2025-01-09 03:48:03,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:03,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292612260] [2025-01-09 03:48:03,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:03,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:03,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 03:48:03,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 03:48:03,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:03,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:03,792 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:48:03,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:03,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292612260] [2025-01-09 03:48:03,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292612260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:03,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:03,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:03,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334751850] [2025-01-09 03:48:03,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:03,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:03,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:03,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:03,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:03,794 INFO L87 Difference]: Start difference. First operand 530 states and 870 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:48:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:03,919 INFO L93 Difference]: Finished difference Result 1017 states and 1682 transitions. [2025-01-09 03:48:03,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:03,920 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:48:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:03,924 INFO L225 Difference]: With dead ends: 1017 [2025-01-09 03:48:03,924 INFO L226 Difference]: Without dead ends: 539 [2025-01-09 03:48:03,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:03,926 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 53 mSDsluCounter, 3294 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4128 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:03,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4128 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:03,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-01-09 03:48:03,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 530. [2025-01-09 03:48:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 418 states have (on average 1.6578947368421053) internal successors, (693), 439 states have internal predecessors, (693), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 03:48:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 866 transitions. [2025-01-09 03:48:03,941 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 866 transitions. Word has length 67 [2025-01-09 03:48:03,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:03,942 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 866 transitions. [2025-01-09 03:48:03,942 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:48:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 866 transitions. [2025-01-09 03:48:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 03:48:03,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:03,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:03,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:48:03,943 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:03,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:03,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1424832759, now seen corresponding path program 1 times [2025-01-09 03:48:03,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:03,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484204039] [2025-01-09 03:48:03,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:03,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:03,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 03:48:03,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 03:48:03,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:03,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:04,045 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:48:04,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:04,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484204039] [2025-01-09 03:48:04,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484204039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:04,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:04,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:04,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620523279] [2025-01-09 03:48:04,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:04,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:04,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:04,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:04,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:04,047 INFO L87 Difference]: Start difference. First operand 530 states and 866 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:48:04,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:04,099 INFO L93 Difference]: Finished difference Result 1008 states and 1664 transitions. [2025-01-09 03:48:04,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:04,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 67 [2025-01-09 03:48:04,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:04,104 INFO L225 Difference]: With dead ends: 1008 [2025-01-09 03:48:04,104 INFO L226 Difference]: Without dead ends: 509 [2025-01-09 03:48:04,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:04,106 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 84 mSDsluCounter, 4202 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5057 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:04,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5057 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:04,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-01-09 03:48:04,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-01-09 03:48:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 397 states have (on average 1.6599496221662469) internal successors, (659), 418 states have internal predecessors, (659), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 03:48:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 832 transitions. [2025-01-09 03:48:04,121 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 832 transitions. Word has length 67 [2025-01-09 03:48:04,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:04,122 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 832 transitions. [2025-01-09 03:48:04,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:48:04,122 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 832 transitions. [2025-01-09 03:48:04,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:48:04,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:04,123 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:48:04,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:48:04,123 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:04,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:04,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1923402062, now seen corresponding path program 1 times [2025-01-09 03:48:04,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:04,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261109991] [2025-01-09 03:48:04,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:04,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:04,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:48:04,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:48:04,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:04,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:04,220 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:48:04,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:04,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261109991] [2025-01-09 03:48:04,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261109991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:04,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:04,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:04,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392541439] [2025-01-09 03:48:04,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:04,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:04,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:04,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:04,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:04,222 INFO L87 Difference]: Start difference. First operand 509 states and 832 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:48:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:04,288 INFO L93 Difference]: Finished difference Result 987 states and 1630 transitions. [2025-01-09 03:48:04,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:04,288 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:48:04,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:04,292 INFO L225 Difference]: With dead ends: 987 [2025-01-09 03:48:04,292 INFO L226 Difference]: Without dead ends: 509 [2025-01-09 03:48:04,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:04,295 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 17 mSDsluCounter, 3251 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4066 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:04,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4066 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:04,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-01-09 03:48:04,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-01-09 03:48:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 397 states have (on average 1.6574307304785894) internal successors, (658), 418 states have internal predecessors, (658), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 03:48:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 831 transitions. [2025-01-09 03:48:04,309 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 831 transitions. Word has length 68 [2025-01-09 03:48:04,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:04,309 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 831 transitions. [2025-01-09 03:48:04,309 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:48:04,310 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 831 transitions. [2025-01-09 03:48:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 03:48:04,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:04,311 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:48:04,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:48:04,311 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:04,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:04,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1055814834, now seen corresponding path program 1 times [2025-01-09 03:48:04,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:04,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806821322] [2025-01-09 03:48:04,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:04,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:04,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 03:48:04,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 03:48:04,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:04,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:04,398 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:48:04,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:04,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806821322] [2025-01-09 03:48:04,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806821322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:04,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:04,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:04,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035395821] [2025-01-09 03:48:04,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:04,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:04,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:04,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:04,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:04,400 INFO L87 Difference]: Start difference. First operand 509 states and 831 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:48:04,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:04,465 INFO L93 Difference]: Finished difference Result 987 states and 1629 transitions. [2025-01-09 03:48:04,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:04,466 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:48:04,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:04,469 INFO L225 Difference]: With dead ends: 987 [2025-01-09 03:48:04,470 INFO L226 Difference]: Without dead ends: 509 [2025-01-09 03:48:04,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:04,472 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 16 mSDsluCounter, 3251 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4066 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:04,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4066 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:04,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-01-09 03:48:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-01-09 03:48:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 397 states have (on average 1.654911838790932) internal successors, (657), 418 states have internal predecessors, (657), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 03:48:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 830 transitions. [2025-01-09 03:48:04,487 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 830 transitions. Word has length 69 [2025-01-09 03:48:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:04,487 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 830 transitions. [2025-01-09 03:48:04,488 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:48:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 830 transitions. [2025-01-09 03:48:04,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 03:48:04,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:04,489 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:48:04,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:48:04,489 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:04,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:04,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1571539943, now seen corresponding path program 1 times [2025-01-09 03:48:04,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:04,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690565486] [2025-01-09 03:48:04,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:04,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:04,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 03:48:04,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 03:48:04,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:04,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:04,569 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:48:04,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:04,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690565486] [2025-01-09 03:48:04,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690565486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:04,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:04,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:04,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907054526] [2025-01-09 03:48:04,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:04,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:04,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:04,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:04,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:04,571 INFO L87 Difference]: Start difference. First operand 509 states and 830 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:48:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:04,598 INFO L93 Difference]: Finished difference Result 987 states and 1628 transitions. [2025-01-09 03:48:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:04,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 70 [2025-01-09 03:48:04,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:04,602 INFO L225 Difference]: With dead ends: 987 [2025-01-09 03:48:04,602 INFO L226 Difference]: Without dead ends: 509 [2025-01-09 03:48:04,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:04,604 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 9 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:04,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2463 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:04,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-01-09 03:48:04,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-01-09 03:48:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 397 states have (on average 1.6523929471032746) internal successors, (656), 418 states have internal predecessors, (656), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 03:48:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 829 transitions. [2025-01-09 03:48:04,622 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 829 transitions. Word has length 70 [2025-01-09 03:48:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:04,623 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 829 transitions. [2025-01-09 03:48:04,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:48:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 829 transitions. [2025-01-09 03:48:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 03:48:04,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:04,625 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:48:04,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:48:04,625 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:04,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:04,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1351620055, now seen corresponding path program 1 times [2025-01-09 03:48:04,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:04,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098176675] [2025-01-09 03:48:04,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:04,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:04,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 03:48:04,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 03:48:04,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:04,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:04,693 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:48:04,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:04,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098176675] [2025-01-09 03:48:04,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098176675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:04,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:04,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:04,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688583125] [2025-01-09 03:48:04,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:04,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:04,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:04,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:04,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:04,694 INFO L87 Difference]: Start difference. First operand 509 states and 829 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:48:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:04,726 INFO L93 Difference]: Finished difference Result 981 states and 1616 transitions. [2025-01-09 03:48:04,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:04,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 70 [2025-01-09 03:48:04,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:04,733 INFO L225 Difference]: With dead ends: 981 [2025-01-09 03:48:04,733 INFO L226 Difference]: Without dead ends: 509 [2025-01-09 03:48:04,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:04,738 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 4 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2442 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:04,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2442 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:04,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-01-09 03:48:04,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-01-09 03:48:04,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 397 states have (on average 1.649874055415617) internal successors, (655), 418 states have internal predecessors, (655), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 03:48:04,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 828 transitions. [2025-01-09 03:48:04,753 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 828 transitions. Word has length 70 [2025-01-09 03:48:04,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:04,754 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 828 transitions. [2025-01-09 03:48:04,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:48:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 828 transitions. [2025-01-09 03:48:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 03:48:04,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:04,756 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:48:04,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:48:04,757 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:04,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:04,757 INFO L85 PathProgramCache]: Analyzing trace with hash 737273117, now seen corresponding path program 1 times [2025-01-09 03:48:04,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:04,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529676971] [2025-01-09 03:48:04,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:04,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:04,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 03:48:04,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 03:48:04,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:04,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:04,966 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:48:04,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:04,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529676971] [2025-01-09 03:48:04,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529676971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:04,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:04,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:04,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659706726] [2025-01-09 03:48:04,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:04,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:04,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:04,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:04,969 INFO L87 Difference]: Start difference. First operand 509 states and 828 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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:48:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:06,803 INFO L93 Difference]: Finished difference Result 1567 states and 2615 transitions. [2025-01-09 03:48:06,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:06,803 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), 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 71 [2025-01-09 03:48:06,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:06,810 INFO L225 Difference]: With dead ends: 1567 [2025-01-09 03:48:06,811 INFO L226 Difference]: Without dead ends: 1103 [2025-01-09 03:48:06,812 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:48:06,813 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 2482 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 529 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2539 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 529 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:06,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2539 Valid, 1129 Invalid, 2362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [529 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 03:48:06,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2025-01-09 03:48:06,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 971. [2025-01-09 03:48:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 767 states have (on average 1.6753585397653195) internal successors, (1285), 797 states have internal predecessors, (1285), 163 states have call successors, (163), 39 states have call predecessors, (163), 40 states have return successors, (165), 147 states have call predecessors, (165), 158 states have call successors, (165) [2025-01-09 03:48:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1613 transitions. [2025-01-09 03:48:06,860 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1613 transitions. Word has length 71 [2025-01-09 03:48:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:06,860 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1613 transitions. [2025-01-09 03:48:06,861 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), 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:48:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1613 transitions. [2025-01-09 03:48:06,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 03:48:06,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:06,864 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] [2025-01-09 03:48:06,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:48:06,865 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:06,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:06,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1973512065, now seen corresponding path program 1 times [2025-01-09 03:48:06,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:06,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285250479] [2025-01-09 03:48:06,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:06,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:06,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 03:48:06,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:48:06,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:06,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:07,138 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:48:07,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:07,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285250479] [2025-01-09 03:48:07,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285250479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:07,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:07,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:48:07,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110624165] [2025-01-09 03:48:07,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:07,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:48:07,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:07,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:48:07,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:07,140 INFO L87 Difference]: Start difference. First operand 971 states and 1613 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:48:08,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:08,475 INFO L93 Difference]: Finished difference Result 1905 states and 3229 transitions. [2025-01-09 03:48:08,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:48:08,476 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2025-01-09 03:48:08,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:08,483 INFO L225 Difference]: With dead ends: 1905 [2025-01-09 03:48:08,483 INFO L226 Difference]: Without dead ends: 979 [2025-01-09 03:48:08,487 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:48:08,488 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 1272 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 2584 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 2948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 2584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:08,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 1574 Invalid, 2948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 2584 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 03:48:08,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-01-09 03:48:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 979. [2025-01-09 03:48:08,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 773 states have (on average 1.6701164294954722) internal successors, (1291), 803 states have internal predecessors, (1291), 163 states have call successors, (163), 39 states have call predecessors, (163), 42 states have return successors, (197), 149 states have call predecessors, (197), 158 states have call successors, (197) [2025-01-09 03:48:08,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1651 transitions. [2025-01-09 03:48:08,531 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1651 transitions. Word has length 100 [2025-01-09 03:48:08,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:08,532 INFO L471 AbstractCegarLoop]: Abstraction has 979 states and 1651 transitions. [2025-01-09 03:48:08,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:48:08,532 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1651 transitions. [2025-01-09 03:48:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 03:48:08,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:08,534 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] [2025-01-09 03:48:08,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:48:08,535 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:08,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash 314880420, now seen corresponding path program 1 times [2025-01-09 03:48:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:08,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970297595] [2025-01-09 03:48:08,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:08,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 03:48:08,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:48:08,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:08,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:08,826 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:48:08,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:08,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970297595] [2025-01-09 03:48:08,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970297595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:08,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:08,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 03:48:08,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793067654] [2025-01-09 03:48:08,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:08,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 03:48:08,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:08,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 03:48:08,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:48:08,828 INFO L87 Difference]: Start difference. First operand 979 states and 1651 transitions. Second operand has 14 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 7 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-01-09 03:48:13,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:13,288 INFO L93 Difference]: Finished difference Result 3516 states and 5983 transitions. [2025-01-09 03:48:13,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 03:48:13,288 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 7 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 100 [2025-01-09 03:48:13,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:13,303 INFO L225 Difference]: With dead ends: 3516 [2025-01-09 03:48:13,303 INFO L226 Difference]: Without dead ends: 2582 [2025-01-09 03:48:13,308 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:48:13,308 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 2657 mSDsluCounter, 5951 mSDsCounter, 0 mSdLazyCounter, 11597 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2728 SdHoareTripleChecker+Valid, 6645 SdHoareTripleChecker+Invalid, 12395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 11597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:13,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2728 Valid, 6645 Invalid, 12395 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [798 Valid, 11597 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 03:48:13,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2025-01-09 03:48:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 2484. [2025-01-09 03:48:13,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2484 states, 1910 states have (on average 1.6460732984293194) internal successors, (3144), 1986 states have internal predecessors, (3144), 463 states have call successors, (463), 87 states have call predecessors, (463), 110 states have return successors, (562), 443 states have call predecessors, (562), 458 states have call successors, (562) [2025-01-09 03:48:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 4169 transitions. [2025-01-09 03:48:13,422 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 4169 transitions. Word has length 100 [2025-01-09 03:48:13,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:13,422 INFO L471 AbstractCegarLoop]: Abstraction has 2484 states and 4169 transitions. [2025-01-09 03:48:13,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 7 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-01-09 03:48:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 4169 transitions. [2025-01-09 03:48:13,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:48:13,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:13,425 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] [2025-01-09 03:48:13,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:48:13,425 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:13,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:13,425 INFO L85 PathProgramCache]: Analyzing trace with hash 496115541, now seen corresponding path program 1 times [2025-01-09 03:48:13,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:13,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452046913] [2025-01-09 03:48:13,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:13,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:13,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:48:13,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:48:13,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:13,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:13,577 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:48:13,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:13,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452046913] [2025-01-09 03:48:13,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452046913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:13,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:13,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:13,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127753061] [2025-01-09 03:48:13,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:13,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:13,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:13,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:13,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:13,579 INFO L87 Difference]: Start difference. First operand 2484 states and 4169 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 03:48:15,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:15,629 INFO L93 Difference]: Finished difference Result 7915 states and 13580 transitions. [2025-01-09 03:48:15,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 03:48:15,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 101 [2025-01-09 03:48:15,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:15,658 INFO L225 Difference]: With dead ends: 7915 [2025-01-09 03:48:15,658 INFO L226 Difference]: Without dead ends: 5476 [2025-01-09 03:48:15,672 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:48:15,672 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 2647 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 4276 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2710 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 4951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 4276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:15,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2710 Valid, 2333 Invalid, 4951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [675 Valid, 4276 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 03:48:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5476 states. [2025-01-09 03:48:15,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5476 to 5181. [2025-01-09 03:48:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5181 states, 3948 states have (on average 1.6253799392097263) internal successors, (6417), 4129 states have internal predecessors, (6417), 995 states have call successors, (995), 205 states have call predecessors, (995), 237 states have return successors, (1144), 923 states have call predecessors, (1144), 990 states have call successors, (1144) [2025-01-09 03:48:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 8556 transitions. [2025-01-09 03:48:16,015 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 8556 transitions. Word has length 101 [2025-01-09 03:48:16,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:16,016 INFO L471 AbstractCegarLoop]: Abstraction has 5181 states and 8556 transitions. [2025-01-09 03:48:16,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 03:48:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 8556 transitions. [2025-01-09 03:48:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 03:48:16,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:16,019 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] [2025-01-09 03:48:16,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:48:16,019 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:16,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:16,020 INFO L85 PathProgramCache]: Analyzing trace with hash 28151868, now seen corresponding path program 1 times [2025-01-09 03:48:16,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:16,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996579931] [2025-01-09 03:48:16,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:16,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:16,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:48:16,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:48:16,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:16,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:16,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:16,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996579931] [2025-01-09 03:48:16,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996579931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:16,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:16,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:16,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449189399] [2025-01-09 03:48:16,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:16,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:16,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:16,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:16,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:16,244 INFO L87 Difference]: Start difference. First operand 5181 states and 8556 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 03:48:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:18,253 INFO L93 Difference]: Finished difference Result 15526 states and 26127 transitions. [2025-01-09 03:48:18,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 03:48:18,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 103 [2025-01-09 03:48:18,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:18,320 INFO L225 Difference]: With dead ends: 15526 [2025-01-09 03:48:18,320 INFO L226 Difference]: Without dead ends: 11075 [2025-01-09 03:48:18,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:48:18,343 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 2305 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 3542 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2376 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 4023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 3542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:18,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2376 Valid, 1621 Invalid, 4023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 3542 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 03:48:18,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11075 states. [2025-01-09 03:48:18,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11075 to 10539. [2025-01-09 03:48:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10539 states, 8027 states have (on average 1.627631742867821) internal successors, (13065), 8427 states have internal predecessors, (13065), 1971 states have call successors, (1971), 399 states have call predecessors, (1971), 540 states have return successors, (2541), 1855 states have call predecessors, (2541), 1966 states have call successors, (2541) [2025-01-09 03:48:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10539 states to 10539 states and 17577 transitions. [2025-01-09 03:48:18,900 INFO L78 Accepts]: Start accepts. Automaton has 10539 states and 17577 transitions. Word has length 103 [2025-01-09 03:48:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:18,902 INFO L471 AbstractCegarLoop]: Abstraction has 10539 states and 17577 transitions. [2025-01-09 03:48:18,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 03:48:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 10539 states and 17577 transitions. [2025-01-09 03:48:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:48:18,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:18,905 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] [2025-01-09 03:48:18,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:48:18,905 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:18,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:18,906 INFO L85 PathProgramCache]: Analyzing trace with hash 544618977, now seen corresponding path program 1 times [2025-01-09 03:48:18,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:18,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614482135] [2025-01-09 03:48:18,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:18,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:18,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:48:18,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:48:18,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:18,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:19,025 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:48:19,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:19,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614482135] [2025-01-09 03:48:19,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614482135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:19,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:19,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:48:19,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033931691] [2025-01-09 03:48:19,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:19,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:48:19,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:19,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:48:19,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:19,028 INFO L87 Difference]: Start difference. First operand 10539 states and 17577 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:19,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:19,571 INFO L93 Difference]: Finished difference Result 20396 states and 34179 transitions. [2025-01-09 03:48:19,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:48:19,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-01-09 03:48:19,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:19,631 INFO L225 Difference]: With dead ends: 20396 [2025-01-09 03:48:19,631 INFO L226 Difference]: Without dead ends: 10697 [2025-01-09 03:48:19,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:19,662 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 0 mSDsluCounter, 2448 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3274 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:19,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3274 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10697 states. [2025-01-09 03:48:20,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10697 to 10661. [2025-01-09 03:48:20,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10661 states, 8123 states have (on average 1.6194755632155609) internal successors, (13155), 8517 states have internal predecessors, (13155), 1965 states have call successors, (1965), 399 states have call predecessors, (1965), 572 states have return successors, (2629), 1887 states have call predecessors, (2629), 1960 states have call successors, (2629) [2025-01-09 03:48:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10661 states to 10661 states and 17749 transitions. [2025-01-09 03:48:20,120 INFO L78 Accepts]: Start accepts. Automaton has 10661 states and 17749 transitions. Word has length 108 [2025-01-09 03:48:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:20,121 INFO L471 AbstractCegarLoop]: Abstraction has 10661 states and 17749 transitions. [2025-01-09 03:48:20,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 10661 states and 17749 transitions. [2025-01-09 03:48:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:48:20,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:20,124 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, 1, 1] [2025-01-09 03:48:20,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:48:20,124 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:20,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:20,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1799627640, now seen corresponding path program 1 times [2025-01-09 03:48:20,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:20,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218147581] [2025-01-09 03:48:20,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:20,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:20,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:48:20,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:48:20,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:20,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:20,290 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:48:20,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:20,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218147581] [2025-01-09 03:48:20,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218147581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:20,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:20,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:48:20,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057824596] [2025-01-09 03:48:20,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:20,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:48:20,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:20,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:48:20,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:20,293 INFO L87 Difference]: Start difference. First operand 10661 states and 17749 transitions. Second operand has 9 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:48:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:20,908 INFO L93 Difference]: Finished difference Result 22460 states and 38289 transitions. [2025-01-09 03:48:20,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:48:20,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 115 [2025-01-09 03:48:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:20,965 INFO L225 Difference]: With dead ends: 22460 [2025-01-09 03:48:20,965 INFO L226 Difference]: Without dead ends: 10933 [2025-01-09 03:48:21,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:48:21,009 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 235 mSDsluCounter, 5802 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 6673 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:21,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 6673 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10933 states. [2025-01-09 03:48:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10933 to 10661. [2025-01-09 03:48:21,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10661 states, 8123 states have (on average 1.5874676843530715) internal successors, (12895), 8517 states have internal predecessors, (12895), 1965 states have call successors, (1965), 399 states have call predecessors, (1965), 572 states have return successors, (2629), 1887 states have call predecessors, (2629), 1960 states have call successors, (2629) [2025-01-09 03:48:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10661 states to 10661 states and 17489 transitions. [2025-01-09 03:48:21,730 INFO L78 Accepts]: Start accepts. Automaton has 10661 states and 17489 transitions. Word has length 115 [2025-01-09 03:48:21,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:21,731 INFO L471 AbstractCegarLoop]: Abstraction has 10661 states and 17489 transitions. [2025-01-09 03:48:21,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:48:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 10661 states and 17489 transitions. [2025-01-09 03:48:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:48:21,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:21,734 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, 1] [2025-01-09 03:48:21,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:48:21,735 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:21,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash -65218650, now seen corresponding path program 1 times [2025-01-09 03:48:21,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:21,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327054482] [2025-01-09 03:48:21,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:21,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:21,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:48:21,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:48:21,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:21,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:48:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:21,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327054482] [2025-01-09 03:48:21,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327054482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:21,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:21,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:21,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201112588] [2025-01-09 03:48:21,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:21,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:21,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:21,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:21,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:21,929 INFO L87 Difference]: Start difference. First operand 10661 states and 17489 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:48:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:24,185 INFO L93 Difference]: Finished difference Result 21799 states and 35970 transitions. [2025-01-09 03:48:24,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:48:24,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 120 [2025-01-09 03:48:24,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:24,243 INFO L225 Difference]: With dead ends: 21799 [2025-01-09 03:48:24,244 INFO L226 Difference]: Without dead ends: 11989 [2025-01-09 03:48:24,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-01-09 03:48:24,274 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 2036 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 3087 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2107 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 3539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 3087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:24,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2107 Valid, 1544 Invalid, 3539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 3087 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 03:48:24,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11989 states. [2025-01-09 03:48:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11989 to 11177. [2025-01-09 03:48:24,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11177 states, 8505 states have (on average 1.5722516166960612) internal successors, (13372), 8935 states have internal predecessors, (13372), 2005 states have call successors, (2005), 457 states have call predecessors, (2005), 666 states have return successors, (2817), 1928 states have call predecessors, (2817), 2000 states have call successors, (2817) [2025-01-09 03:48:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11177 states to 11177 states and 18194 transitions. [2025-01-09 03:48:24,705 INFO L78 Accepts]: Start accepts. Automaton has 11177 states and 18194 transitions. Word has length 120 [2025-01-09 03:48:24,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:24,706 INFO L471 AbstractCegarLoop]: Abstraction has 11177 states and 18194 transitions. [2025-01-09 03:48:24,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:48:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand 11177 states and 18194 transitions. [2025-01-09 03:48:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:48:24,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:24,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:24,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:48:24,709 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:24,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:24,709 INFO L85 PathProgramCache]: Analyzing trace with hash -675289461, now seen corresponding path program 1 times [2025-01-09 03:48:24,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:24,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572818042] [2025-01-09 03:48:24,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:24,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:24,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:48:24,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:48:24,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:24,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:48:25,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:25,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572818042] [2025-01-09 03:48:25,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572818042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:25,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:25,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 03:48:25,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859979533] [2025-01-09 03:48:25,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:25,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:48:25,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:25,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:48:25,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:48:25,040 INFO L87 Difference]: Start difference. First operand 11177 states and 18194 transitions. Second operand has 12 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 6 states have call successors, (15), 3 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 03:48:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:28,780 INFO L93 Difference]: Finished difference Result 30775 states and 51264 transitions. [2025-01-09 03:48:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:48:28,781 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 6 states have call successors, (15), 3 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 125 [2025-01-09 03:48:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:28,900 INFO L225 Difference]: With dead ends: 30775 [2025-01-09 03:48:28,900 INFO L226 Difference]: Without dead ends: 19643 [2025-01-09 03:48:28,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-01-09 03:48:28,950 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 3206 mSDsluCounter, 5691 mSDsCounter, 0 mSdLazyCounter, 9056 mSolverCounterSat, 946 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3243 SdHoareTripleChecker+Valid, 6531 SdHoareTripleChecker+Invalid, 10002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 946 IncrementalHoareTripleChecker+Valid, 9056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:28,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3243 Valid, 6531 Invalid, 10002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [946 Valid, 9056 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 03:48:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19643 states. [2025-01-09 03:48:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19643 to 18589. [2025-01-09 03:48:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18589 states, 13611 states have (on average 1.5555065755638822) internal successors, (21172), 14501 states have internal predecessors, (21172), 3926 states have call successors, (3926), 697 states have call predecessors, (3926), 1051 states have return successors, (5424), 3886 states have call predecessors, (5424), 3921 states have call successors, (5424) [2025-01-09 03:48:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 30522 transitions. [2025-01-09 03:48:30,207 INFO L78 Accepts]: Start accepts. Automaton has 18589 states and 30522 transitions. Word has length 125 [2025-01-09 03:48:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:30,207 INFO L471 AbstractCegarLoop]: Abstraction has 18589 states and 30522 transitions. [2025-01-09 03:48:30,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 6 states have call successors, (15), 3 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 03:48:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 18589 states and 30522 transitions. [2025-01-09 03:48:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 03:48:30,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:30,218 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:30,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 03:48:30,218 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:30,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:30,219 INFO L85 PathProgramCache]: Analyzing trace with hash 195907402, now seen corresponding path program 1 times [2025-01-09 03:48:30,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:30,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8389098] [2025-01-09 03:48:30,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:30,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:30,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 03:48:30,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 03:48:30,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:30,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:48:30,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:30,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8389098] [2025-01-09 03:48:30,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8389098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:30,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:30,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 03:48:30,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190835697] [2025-01-09 03:48:30,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:30,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:48:30,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:30,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:48:30,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:48:30,497 INFO L87 Difference]: Start difference. First operand 18589 states and 30522 transitions. Second operand has 12 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 6 states have call successors, (15), 3 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 03:48:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:35,337 INFO L93 Difference]: Finished difference Result 58847 states and 99767 transitions. [2025-01-09 03:48:35,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:48:35,337 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 6 states have call successors, (15), 3 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 126 [2025-01-09 03:48:35,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:35,611 INFO L225 Difference]: With dead ends: 58847 [2025-01-09 03:48:35,612 INFO L226 Difference]: Without dead ends: 40303 [2025-01-09 03:48:35,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-01-09 03:48:35,706 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 3204 mSDsluCounter, 5646 mSDsCounter, 0 mSdLazyCounter, 9060 mSolverCounterSat, 939 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3241 SdHoareTripleChecker+Valid, 6479 SdHoareTripleChecker+Invalid, 9999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 939 IncrementalHoareTripleChecker+Valid, 9060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:35,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3241 Valid, 6479 Invalid, 9999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [939 Valid, 9060 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 03:48:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40303 states. [2025-01-09 03:48:37,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40303 to 39084. [2025-01-09 03:48:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39084 states, 26944 states have (on average 1.5372253562945368) internal successors, (41419), 29232 states have internal predecessors, (41419), 10188 states have call successors, (10188), 1177 states have call predecessors, (10188), 1951 states have return successors, (14087), 10355 states have call predecessors, (14087), 10183 states have call successors, (14087) [2025-01-09 03:48:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39084 states to 39084 states and 65694 transitions. [2025-01-09 03:48:37,921 INFO L78 Accepts]: Start accepts. Automaton has 39084 states and 65694 transitions. Word has length 126 [2025-01-09 03:48:37,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:37,921 INFO L471 AbstractCegarLoop]: Abstraction has 39084 states and 65694 transitions. [2025-01-09 03:48:37,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 6 states have call successors, (15), 3 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 03:48:37,922 INFO L276 IsEmpty]: Start isEmpty. Operand 39084 states and 65694 transitions. [2025-01-09 03:48:37,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:48:37,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:37,924 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:37,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 03:48:37,924 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:37,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:37,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1743489425, now seen corresponding path program 1 times [2025-01-09 03:48:37,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:37,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615877214] [2025-01-09 03:48:37,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:37,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:37,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:48:37,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:48:37,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:37,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:48:38,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:38,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615877214] [2025-01-09 03:48:38,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615877214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:38,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:38,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 03:48:38,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672519407] [2025-01-09 03:48:38,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:38,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:48:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:38,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:48:38,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:48:38,129 INFO L87 Difference]: Start difference. First operand 39084 states and 65694 transitions. Second operand has 12 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 6 states have call successors, (15), 3 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 03:48:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:48,190 INFO L93 Difference]: Finished difference Result 141618 states and 247236 transitions. [2025-01-09 03:48:48,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:48:48,190 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 6 states have call successors, (15), 3 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 127 [2025-01-09 03:48:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:49,054 INFO L225 Difference]: With dead ends: 141618 [2025-01-09 03:48:49,054 INFO L226 Difference]: Without dead ends: 102579 [2025-01-09 03:48:49,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-01-09 03:48:49,292 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 3974 mSDsluCounter, 5365 mSDsCounter, 0 mSdLazyCounter, 8457 mSolverCounterSat, 1219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4011 SdHoareTripleChecker+Valid, 6198 SdHoareTripleChecker+Invalid, 9676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1219 IncrementalHoareTripleChecker+Valid, 8457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:49,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4011 Valid, 6198 Invalid, 9676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1219 Valid, 8457 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 03:48:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102579 states. [2025-01-09 03:48:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102579 to 100978. [2025-01-09 03:48:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100978 states, 65092 states have (on average 1.5195722976709887) internal successors, (98912), 71860 states have internal predecessors, (98912), 31634 states have call successors, (31634), 2137 states have call predecessors, (31634), 4251 states have return successors, (44919), 32747 states have call predecessors, (44919), 31629 states have call successors, (44919) [2025-01-09 03:48:55,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100978 states to 100978 states and 175465 transitions. [2025-01-09 03:48:55,880 INFO L78 Accepts]: Start accepts. Automaton has 100978 states and 175465 transitions. Word has length 127 [2025-01-09 03:48:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:55,881 INFO L471 AbstractCegarLoop]: Abstraction has 100978 states and 175465 transitions. [2025-01-09 03:48:55,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 6 states have call successors, (15), 3 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 03:48:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 100978 states and 175465 transitions. [2025-01-09 03:48:55,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:48:55,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:55,884 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:55,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 03:48:55,884 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:55,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:55,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1544274684, now seen corresponding path program 1 times [2025-01-09 03:48:55,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:55,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371547557] [2025-01-09 03:48:55,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:55,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:55,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:48:55,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:48:55,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:55,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:56,116 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:48:56,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:56,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371547557] [2025-01-09 03:48:56,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371547557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:56,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:56,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 03:48:56,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095042248] [2025-01-09 03:48:56,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:56,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:48:56,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:56,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:48:56,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:48:56,118 INFO L87 Difference]: Start difference. First operand 100978 states and 175465 transitions. Second operand has 13 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 7 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15)