./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_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_spec2_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 c39b0b488ad07619ca8d4ed9273747459006984c072c0894ad54004ae965569d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:45:10,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:45:10,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:45:10,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:45:10,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:45:11,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:45:11,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:45:11,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:45:11,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:45:11,005 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:45:11,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:45:11,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:45:11,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:45:11,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:45:11,006 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:45:11,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:45:11,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:45:11,006 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:45:11,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:45:11,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:45:11,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:45:11,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:45:11,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:45:11,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:45:11,006 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:45:11,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:45:11,007 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:45:11,007 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:45:11,007 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:45:11,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:45:11,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:45:11,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:45:11,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:45:11,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:45:11,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:45:11,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:45:11,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:45:11,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:45:11,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:45:11,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:45:11,007 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:45:11,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:45:11,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:45:11,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:45:11,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:45:11,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:45:11,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:45:11,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:45:11,008 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 -> c39b0b488ad07619ca8d4ed9273747459006984c072c0894ad54004ae965569d [2025-01-09 03:45:11,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:45:11,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:45:11,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:45:11,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:45:11,240 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:45:11,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c [2025-01-09 03:45:12,648 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d8938373/eb468df2e61a4516844ed2f87e7a18bb/FLAG9a6f7eeae [2025-01-09 03:45:12,957 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:45:12,958 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c [2025-01-09 03:45:12,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d8938373/eb468df2e61a4516844ed2f87e7a18bb/FLAG9a6f7eeae [2025-01-09 03:45:13,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d8938373/eb468df2e61a4516844ed2f87e7a18bb [2025-01-09 03:45:13,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:45:13,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:45:13,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:45:13,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:45:13,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:45:13,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67385641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13, skipping insertion in model container [2025-01-09 03:45:13,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:45:13,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c[70298,70311] [2025-01-09 03:45:13,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:45:13,421 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:45:13,429 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-01-09 03:45:13,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [412] [2025-01-09 03:45:13,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1940] [2025-01-09 03:45:13,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2058] [2025-01-09 03:45:13,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2070] [2025-01-09 03:45:13,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2436] [2025-01-09 03:45:13,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2471] [2025-01-09 03:45:13,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [3132] [2025-01-09 03:45:13,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3314] [2025-01-09 03:45:13,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3323] [2025-01-09 03:45:13,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c[70298,70311] [2025-01-09 03:45:13,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:45:13,569 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:45:13,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13 WrapperNode [2025-01-09 03:45:13,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:45:13,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:45:13,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:45:13,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:45:13,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,627 INFO L138 Inliner]: procedures = 93, calls = 340, calls flagged for inlining = 28, calls inlined = 24, statements flattened = 857 [2025-01-09 03:45:13,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:45:13,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:45:13,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:45:13,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:45:13,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,677 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-01-09 03:45:13,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,695 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:45:13,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:45:13,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:45:13,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:45:13,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:45:13,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:45:13,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:45:13,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:45:13,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:45:13,796 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:45:13,796 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:45:13,796 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-01-09 03:45:13,796 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-01-09 03:45:13,796 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:45:13,796 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:45:13,796 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:45:13,797 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:45:13,797 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:45:13,797 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:45:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:45:13,798 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:45:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:45:13,798 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:45:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-01-09 03:45:13,798 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-01-09 03:45:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:45:13,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:45:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:45:13,798 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:45:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:45:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:45:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:45:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:45:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:45:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:45:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:45:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:45:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2025-01-09 03:45:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2025-01-09 03:45:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:45:13,800 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:45:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:45:13,800 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:45:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:45:13,800 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:45:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:45:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:45:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:45:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:45:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:45:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:45:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:45:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:45:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:45:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:45:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:45:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:45:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:45:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:45:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:45:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:45:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:45:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:45:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:45:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:45:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:45:13,803 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:45:13,804 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:45:13,804 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:45:13,804 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:45:13,804 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:45:13,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:45:13,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:45:13,804 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:45:13,804 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:45:13,965 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:45:13,967 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:45:14,894 INFO L? ?]: Removed 441 outVars from TransFormulas that were not future-live. [2025-01-09 03:45:14,894 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:45:14,910 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:45:14,910 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:45:14,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:45:14 BoogieIcfgContainer [2025-01-09 03:45:14,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:45:14,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:45:14,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:45:14,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:45:14,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:45:13" (1/3) ... [2025-01-09 03:45:14,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255d37e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:45:14, skipping insertion in model container [2025-01-09 03:45:14,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13" (2/3) ... [2025-01-09 03:45:14,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255d37e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:45:14, skipping insertion in model container [2025-01-09 03:45:14,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:45:14" (3/3) ... [2025-01-09 03:45:14,918 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product26.cil.c [2025-01-09 03:45:14,929 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:45:14,932 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product26.cil.c that has 23 procedures, 549 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:45:14,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:45:14,992 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;@66b4eac9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:45:14,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:45:14,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 549 states, 434 states have (on average 1.707373271889401) internal successors, (741), 457 states have internal predecessors, (741), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 03:45:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 03:45:15,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:15,007 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] [2025-01-09 03:45:15,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:15,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:15,011 INFO L85 PathProgramCache]: Analyzing trace with hash 866997941, now seen corresponding path program 1 times [2025-01-09 03:45:15,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:15,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340192062] [2025-01-09 03:45:15,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:15,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:15,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 03:45:15,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 03:45:15,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:15,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:15,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:15,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340192062] [2025-01-09 03:45:15,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340192062] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:15,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:15,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:15,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291063192] [2025-01-09 03:45:15,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:15,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:15,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:15,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:15,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:15,462 INFO L87 Difference]: Start difference. First operand has 549 states, 434 states have (on average 1.707373271889401) internal successors, (741), 457 states have internal predecessors, (741), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:15,659 INFO L93 Difference]: Finished difference Result 1078 states and 1821 transitions. [2025-01-09 03:45:15,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:15,661 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2025-01-09 03:45:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:15,674 INFO L225 Difference]: With dead ends: 1078 [2025-01-09 03:45:15,674 INFO L226 Difference]: Without dead ends: 541 [2025-01-09 03:45:15,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:15,684 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 5 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:15,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2705 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:15,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-01-09 03:45:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-01-09 03:45:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 428 states have (on average 1.705607476635514) internal successors, (730), 449 states have internal predecessors, (730), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:45:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 907 transitions. [2025-01-09 03:45:15,757 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 907 transitions. Word has length 56 [2025-01-09 03:45:15,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:15,759 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 907 transitions. [2025-01-09 03:45:15,759 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 907 transitions. [2025-01-09 03:45:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 03:45:15,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:15,764 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:45:15,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:45:15,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:15,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash 488335906, now seen corresponding path program 1 times [2025-01-09 03:45:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544799783] [2025-01-09 03:45:15,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:15,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 03:45:15,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 03:45:15,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:15,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:15,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:15,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:15,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544799783] [2025-01-09 03:45:15,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544799783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:15,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:15,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:15,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392040487] [2025-01-09 03:45:15,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:15,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:15,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:15,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:15,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:15,962 INFO L87 Difference]: Start difference. First operand 541 states and 907 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:16,014 INFO L93 Difference]: Finished difference Result 1064 states and 1791 transitions. [2025-01-09 03:45:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:16,015 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2025-01-09 03:45:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:16,020 INFO L225 Difference]: With dead ends: 1064 [2025-01-09 03:45:16,020 INFO L226 Difference]: Without dead ends: 541 [2025-01-09 03:45:16,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:16,023 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 4 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:16,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2684 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-01-09 03:45:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-01-09 03:45:16,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 428 states have (on average 1.7032710280373833) internal successors, (729), 449 states have internal predecessors, (729), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:45:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 906 transitions. [2025-01-09 03:45:16,047 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 906 transitions. Word has length 58 [2025-01-09 03:45:16,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:16,048 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 906 transitions. [2025-01-09 03:45:16,048 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 906 transitions. [2025-01-09 03:45:16,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 03:45:16,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:16,050 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] [2025-01-09 03:45:16,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:45:16,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:16,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:16,051 INFO L85 PathProgramCache]: Analyzing trace with hash 963213074, now seen corresponding path program 1 times [2025-01-09 03:45:16,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:16,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659894444] [2025-01-09 03:45:16,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:16,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:16,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 03:45:16,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 03:45:16,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:16,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:16,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:16,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:16,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659894444] [2025-01-09 03:45:16,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659894444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:16,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:16,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:16,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572615959] [2025-01-09 03:45:16,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:16,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:16,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:16,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:16,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:16,175 INFO L87 Difference]: Start difference. First operand 541 states and 906 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:16,223 INFO L93 Difference]: Finished difference Result 1064 states and 1790 transitions. [2025-01-09 03:45:16,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:16,223 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2025-01-09 03:45:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:16,227 INFO L225 Difference]: With dead ends: 1064 [2025-01-09 03:45:16,227 INFO L226 Difference]: Without dead ends: 541 [2025-01-09 03:45:16,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:16,230 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 3 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:16,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2684 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-01-09 03:45:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-01-09 03:45:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 428 states have (on average 1.7009345794392523) internal successors, (728), 449 states have internal predecessors, (728), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:45:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 905 transitions. [2025-01-09 03:45:16,251 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 905 transitions. Word has length 59 [2025-01-09 03:45:16,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:16,251 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 905 transitions. [2025-01-09 03:45:16,252 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:16,252 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 905 transitions. [2025-01-09 03:45:16,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 03:45:16,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:16,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:16,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:45:16,254 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:16,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:16,254 INFO L85 PathProgramCache]: Analyzing trace with hash 291508774, now seen corresponding path program 1 times [2025-01-09 03:45:16,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:16,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864404776] [2025-01-09 03:45:16,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:16,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:16,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 03:45:16,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 03:45:16,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:16,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:16,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:16,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864404776] [2025-01-09 03:45:16,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864404776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:16,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:16,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:16,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139523472] [2025-01-09 03:45:16,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:16,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:16,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:16,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:16,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:16,372 INFO L87 Difference]: Start difference. First operand 541 states and 905 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:16,416 INFO L93 Difference]: Finished difference Result 1064 states and 1789 transitions. [2025-01-09 03:45:16,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:16,417 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2025-01-09 03:45:16,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:16,421 INFO L225 Difference]: With dead ends: 1064 [2025-01-09 03:45:16,421 INFO L226 Difference]: Without dead ends: 541 [2025-01-09 03:45:16,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:16,424 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 2 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:16,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2684 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-01-09 03:45:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-01-09 03:45:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 428 states have (on average 1.6985981308411215) internal successors, (727), 449 states have internal predecessors, (727), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:45:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 904 transitions. [2025-01-09 03:45:16,445 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 904 transitions. Word has length 60 [2025-01-09 03:45:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:16,445 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 904 transitions. [2025-01-09 03:45:16,445 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 904 transitions. [2025-01-09 03:45:16,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 03:45:16,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:16,447 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:45:16,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:45:16,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:16,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:16,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1564482666, now seen corresponding path program 1 times [2025-01-09 03:45:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:16,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827559574] [2025-01-09 03:45:16,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:16,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:16,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 03:45:16,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 03:45:16,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:16,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:16,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:16,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827559574] [2025-01-09 03:45:16,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827559574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:16,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:16,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:16,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816382930] [2025-01-09 03:45:16,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:16,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:16,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:16,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:16,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:16,582 INFO L87 Difference]: Start difference. First operand 541 states and 904 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:16,623 INFO L93 Difference]: Finished difference Result 1064 states and 1788 transitions. [2025-01-09 03:45:16,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:16,623 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2025-01-09 03:45:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:16,628 INFO L225 Difference]: With dead ends: 1064 [2025-01-09 03:45:16,628 INFO L226 Difference]: Without dead ends: 541 [2025-01-09 03:45:16,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:16,632 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 1 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:16,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2684 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:16,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-01-09 03:45:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-01-09 03:45:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 428 states have (on average 1.6962616822429906) internal successors, (726), 449 states have internal predecessors, (726), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:45:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 903 transitions. [2025-01-09 03:45:16,665 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 903 transitions. Word has length 61 [2025-01-09 03:45:16,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:16,665 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 903 transitions. [2025-01-09 03:45:16,665 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:16,665 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 903 transitions. [2025-01-09 03:45:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 03:45:16,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:16,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:16,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:45:16,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:16,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:16,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1478669782, now seen corresponding path program 1 times [2025-01-09 03:45:16,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:16,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296988611] [2025-01-09 03:45:16,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:16,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:16,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 03:45:16,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 03:45:16,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:16,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:16,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:16,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296988611] [2025-01-09 03:45:16,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296988611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:16,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:16,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:16,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428104622] [2025-01-09 03:45:16,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:16,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:16,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:16,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:16,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:16,831 INFO L87 Difference]: Start difference. First operand 541 states and 903 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 03:45:16,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:16,912 INFO L93 Difference]: Finished difference Result 1030 states and 1720 transitions. [2025-01-09 03:45:16,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:16,912 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 62 [2025-01-09 03:45:16,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:16,916 INFO L225 Difference]: With dead ends: 1030 [2025-01-09 03:45:16,916 INFO L226 Difference]: Without dead ends: 556 [2025-01-09 03:45:16,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:16,918 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 91 mSDsluCounter, 4384 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5277 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:16,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5277 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:16,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-01-09 03:45:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554. [2025-01-09 03:45:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 438 states have (on average 1.6917808219178083) internal successors, (741), 461 states have internal predecessors, (741), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2025-01-09 03:45:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 922 transitions. [2025-01-09 03:45:16,938 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 922 transitions. Word has length 62 [2025-01-09 03:45:16,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:16,938 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 922 transitions. [2025-01-09 03:45:16,939 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 03:45:16,939 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 922 transitions. [2025-01-09 03:45:16,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 03:45:16,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:16,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:16,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:45:16,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:16,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:16,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1115557035, now seen corresponding path program 1 times [2025-01-09 03:45:16,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:16,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664980967] [2025-01-09 03:45:16,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:16,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:16,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 03:45:16,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 03:45:16,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:16,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:17,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:17,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664980967] [2025-01-09 03:45:17,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664980967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:17,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:17,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:17,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887215355] [2025-01-09 03:45:17,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:17,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:17,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:17,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:17,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:17,027 INFO L87 Difference]: Start difference. First operand 554 states and 922 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:17,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:17,073 INFO L93 Difference]: Finished difference Result 1082 states and 1814 transitions. [2025-01-09 03:45:17,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:17,074 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 62 [2025-01-09 03:45:17,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:17,077 INFO L225 Difference]: With dead ends: 1082 [2025-01-09 03:45:17,077 INFO L226 Difference]: Without dead ends: 535 [2025-01-09 03:45:17,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:17,079 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 0 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2686 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:17,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2686 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-01-09 03:45:17,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-01-09 03:45:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 422 states have (on average 1.6872037914691944) internal successors, (712), 443 states have internal predecessors, (712), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:45:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 889 transitions. [2025-01-09 03:45:17,097 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 889 transitions. Word has length 62 [2025-01-09 03:45:17,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:17,097 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 889 transitions. [2025-01-09 03:45:17,097 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 889 transitions. [2025-01-09 03:45:17,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 03:45:17,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:17,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:17,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:45:17,100 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:17,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:17,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1297318280, now seen corresponding path program 1 times [2025-01-09 03:45:17,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:17,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232686499] [2025-01-09 03:45:17,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:17,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:17,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 03:45:17,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 03:45:17,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:17,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:17,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:45:17,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:17,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232686499] [2025-01-09 03:45:17,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232686499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:17,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:17,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:17,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849681864] [2025-01-09 03:45:17,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:17,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:17,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:17,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:17,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:17,222 INFO L87 Difference]: Start difference. First operand 535 states and 889 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:17,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:17,386 INFO L93 Difference]: Finished difference Result 1027 states and 1712 transitions. [2025-01-09 03:45:17,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:17,387 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 63 [2025-01-09 03:45:17,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:17,390 INFO L225 Difference]: With dead ends: 1027 [2025-01-09 03:45:17,390 INFO L226 Difference]: Without dead ends: 544 [2025-01-09 03:45:17,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:17,393 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 55 mSDsluCounter, 3355 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:17,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4201 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:45:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-01-09 03:45:17,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 535. [2025-01-09 03:45:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 422 states have (on average 1.6777251184834123) internal successors, (708), 443 states have internal predecessors, (708), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:45:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 885 transitions. [2025-01-09 03:45:17,410 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 885 transitions. Word has length 63 [2025-01-09 03:45:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:17,410 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 885 transitions. [2025-01-09 03:45:17,410 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 885 transitions. [2025-01-09 03:45:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 03:45:17,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:17,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:17,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:45:17,411 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:17,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:17,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1449583975, now seen corresponding path program 1 times [2025-01-09 03:45:17,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:17,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270991550] [2025-01-09 03:45:17,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:17,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:17,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 03:45:17,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 03:45:17,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:17,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:17,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:17,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270991550] [2025-01-09 03:45:17,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270991550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:17,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:17,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:17,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098147898] [2025-01-09 03:45:17,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:17,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:17,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:17,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:17,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:17,524 INFO L87 Difference]: Start difference. First operand 535 states and 885 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:17,684 INFO L93 Difference]: Finished difference Result 1027 states and 1708 transitions. [2025-01-09 03:45:17,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:17,687 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 64 [2025-01-09 03:45:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:17,690 INFO L225 Difference]: With dead ends: 1027 [2025-01-09 03:45:17,690 INFO L226 Difference]: Without dead ends: 544 [2025-01-09 03:45:17,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:17,694 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 54 mSDsluCounter, 3355 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:17,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4201 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:45:17,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-01-09 03:45:17,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 535. [2025-01-09 03:45:17,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 422 states have (on average 1.6682464454976302) internal successors, (704), 443 states have internal predecessors, (704), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:45:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 881 transitions. [2025-01-09 03:45:17,711 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 881 transitions. Word has length 64 [2025-01-09 03:45:17,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:17,711 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 881 transitions. [2025-01-09 03:45:17,711 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 881 transitions. [2025-01-09 03:45:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 03:45:17,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:17,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:17,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:45:17,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:17,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:17,716 INFO L85 PathProgramCache]: Analyzing trace with hash 278293363, now seen corresponding path program 1 times [2025-01-09 03:45:17,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:17,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753162765] [2025-01-09 03:45:17,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:17,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:17,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 03:45:17,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 03:45:17,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:17,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:17,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:17,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753162765] [2025-01-09 03:45:17,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753162765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:17,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:17,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:17,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460993084] [2025-01-09 03:45:17,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:17,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:17,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:17,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:17,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:17,819 INFO L87 Difference]: Start difference. First operand 535 states and 881 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:17,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:17,953 INFO L93 Difference]: Finished difference Result 1027 states and 1704 transitions. [2025-01-09 03:45:17,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:17,954 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2025-01-09 03:45:17,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:17,957 INFO L225 Difference]: With dead ends: 1027 [2025-01-09 03:45:17,957 INFO L226 Difference]: Without dead ends: 544 [2025-01-09 03:45:17,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:17,960 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 53 mSDsluCounter, 3338 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4183 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:17,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4183 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:45:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-01-09 03:45:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 535. [2025-01-09 03:45:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 422 states have (on average 1.6587677725118484) internal successors, (700), 443 states have internal predecessors, (700), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:45:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 877 transitions. [2025-01-09 03:45:17,980 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 877 transitions. Word has length 65 [2025-01-09 03:45:17,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:17,980 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 877 transitions. [2025-01-09 03:45:17,980 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 877 transitions. [2025-01-09 03:45:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 03:45:17,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:17,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:17,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:45:17,981 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:17,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:17,981 INFO L85 PathProgramCache]: Analyzing trace with hash 962739955, now seen corresponding path program 1 times [2025-01-09 03:45:17,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:17,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119423672] [2025-01-09 03:45:17,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:17,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 03:45:17,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 03:45:17,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:17,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:18,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:18,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119423672] [2025-01-09 03:45:18,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119423672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:18,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:18,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:18,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708330058] [2025-01-09 03:45:18,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:18,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:18,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:18,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:18,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:18,089 INFO L87 Difference]: Start difference. First operand 535 states and 877 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 03:45:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:18,146 INFO L93 Difference]: Finished difference Result 1018 states and 1686 transitions. [2025-01-09 03:45:18,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:18,147 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2025-01-09 03:45:18,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:18,151 INFO L225 Difference]: With dead ends: 1018 [2025-01-09 03:45:18,151 INFO L226 Difference]: Without dead ends: 514 [2025-01-09 03:45:18,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:18,153 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 84 mSDsluCounter, 4257 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5123 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:18,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5123 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:18,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-09 03:45:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2025-01-09 03:45:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 401 states have (on average 1.660847880299252) internal successors, (666), 422 states have internal predecessors, (666), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:45:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 843 transitions. [2025-01-09 03:45:18,166 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 843 transitions. Word has length 65 [2025-01-09 03:45:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:18,166 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 843 transitions. [2025-01-09 03:45:18,166 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 03:45:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 843 transitions. [2025-01-09 03:45:18,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 03:45:18,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:18,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:18,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:45:18,168 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:18,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:18,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2097891838, now seen corresponding path program 1 times [2025-01-09 03:45:18,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:18,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830436467] [2025-01-09 03:45:18,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:18,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:18,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 03:45:18,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 03:45:18,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:18,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:18,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:18,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830436467] [2025-01-09 03:45:18,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830436467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:18,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:18,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:18,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805615384] [2025-01-09 03:45:18,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:18,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:18,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:18,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:18,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:18,290 INFO L87 Difference]: Start difference. First operand 514 states and 843 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:18,368 INFO L93 Difference]: Finished difference Result 997 states and 1652 transitions. [2025-01-09 03:45:18,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:18,368 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2025-01-09 03:45:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:18,372 INFO L225 Difference]: With dead ends: 997 [2025-01-09 03:45:18,372 INFO L226 Difference]: Without dead ends: 514 [2025-01-09 03:45:18,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:18,374 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 17 mSDsluCounter, 3295 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4121 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:18,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4121 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:18,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-09 03:45:18,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2025-01-09 03:45:18,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 401 states have (on average 1.658354114713217) internal successors, (665), 422 states have internal predecessors, (665), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:45:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 842 transitions. [2025-01-09 03:45:18,390 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 842 transitions. Word has length 66 [2025-01-09 03:45:18,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:18,391 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 842 transitions. [2025-01-09 03:45:18,391 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:18,391 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 842 transitions. [2025-01-09 03:45:18,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 03:45:18,392 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:18,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:18,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:45:18,393 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:18,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:18,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1123863662, now seen corresponding path program 1 times [2025-01-09 03:45:18,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:18,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425317960] [2025-01-09 03:45:18,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:18,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:18,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 03:45:18,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 03:45:18,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:18,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:18,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:18,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425317960] [2025-01-09 03:45:18,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425317960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:18,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:18,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:18,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137697360] [2025-01-09 03:45:18,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:18,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:18,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:18,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:18,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:18,481 INFO L87 Difference]: Start difference. First operand 514 states and 842 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:18,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:18,545 INFO L93 Difference]: Finished difference Result 997 states and 1651 transitions. [2025-01-09 03:45:18,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:18,545 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2025-01-09 03:45:18,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:18,549 INFO L225 Difference]: With dead ends: 997 [2025-01-09 03:45:18,549 INFO L226 Difference]: Without dead ends: 514 [2025-01-09 03:45:18,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:18,551 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 16 mSDsluCounter, 3295 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4121 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:18,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4121 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-09 03:45:18,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2025-01-09 03:45:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 401 states have (on average 1.655860349127182) internal successors, (664), 422 states have internal predecessors, (664), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:45:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 841 transitions. [2025-01-09 03:45:18,563 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 841 transitions. Word has length 67 [2025-01-09 03:45:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:18,563 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 841 transitions. [2025-01-09 03:45:18,563 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, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 841 transitions. [2025-01-09 03:45:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:45:18,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:18,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:18,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:45:18,564 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:18,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:18,564 INFO L85 PathProgramCache]: Analyzing trace with hash 758762459, now seen corresponding path program 1 times [2025-01-09 03:45:18,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:18,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36497743] [2025-01-09 03:45:18,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:18,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:18,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:45:18,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:45:18,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:18,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:18,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36497743] [2025-01-09 03:45:18,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36497743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:18,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:18,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:18,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603257486] [2025-01-09 03:45:18,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:18,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:18,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:18,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:18,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:18,623 INFO L87 Difference]: Start difference. First operand 514 states and 841 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:18,648 INFO L93 Difference]: Finished difference Result 997 states and 1650 transitions. [2025-01-09 03:45:18,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:18,649 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2025-01-09 03:45:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:18,652 INFO L225 Difference]: With dead ends: 997 [2025-01-09 03:45:18,652 INFO L226 Difference]: Without dead ends: 514 [2025-01-09 03:45:18,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:18,654 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 9 mSDsluCounter, 1662 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2496 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:18,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2496 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:18,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-09 03:45:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2025-01-09 03:45:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 401 states have (on average 1.653366583541147) internal successors, (663), 422 states have internal predecessors, (663), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:45:18,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 840 transitions. [2025-01-09 03:45:18,666 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 840 transitions. Word has length 68 [2025-01-09 03:45:18,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:18,666 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 840 transitions. [2025-01-09 03:45:18,666 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, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:18,666 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 840 transitions. [2025-01-09 03:45:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:45:18,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:18,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:18,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:45:18,667 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:18,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:18,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1788121757, now seen corresponding path program 1 times [2025-01-09 03:45:18,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:18,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919022293] [2025-01-09 03:45:18,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:18,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:18,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:45:18,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:45:18,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:18,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:18,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:18,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919022293] [2025-01-09 03:45:18,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919022293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:18,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:18,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:18,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176451709] [2025-01-09 03:45:18,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:18,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:18,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:18,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:18,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:18,752 INFO L87 Difference]: Start difference. First operand 514 states and 840 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:18,788 INFO L93 Difference]: Finished difference Result 991 states and 1638 transitions. [2025-01-09 03:45:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:18,789 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2025-01-09 03:45:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:18,793 INFO L225 Difference]: With dead ends: 991 [2025-01-09 03:45:18,793 INFO L226 Difference]: Without dead ends: 514 [2025-01-09 03:45:18,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:18,795 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 4 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:18,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2475 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-09 03:45:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2025-01-09 03:45:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 401 states have (on average 1.6508728179551122) internal successors, (662), 422 states have internal predecessors, (662), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:45:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 839 transitions. [2025-01-09 03:45:18,809 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 839 transitions. Word has length 68 [2025-01-09 03:45:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:18,810 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 839 transitions. [2025-01-09 03:45:18,810 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 03:45:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 839 transitions. [2025-01-09 03:45:18,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 03:45:18,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:18,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:18,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:45:18,811 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:18,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:18,812 INFO L85 PathProgramCache]: Analyzing trace with hash 59980441, now seen corresponding path program 1 times [2025-01-09 03:45:18,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:18,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023332212] [2025-01-09 03:45:18,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:18,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:18,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 03:45:18,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 03:45:18,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:18,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:18,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:18,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023332212] [2025-01-09 03:45:18,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023332212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:18,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:18,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:18,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632296981] [2025-01-09 03:45:18,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:18,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:18,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:18,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:18,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:18,962 INFO L87 Difference]: Start difference. First operand 514 states and 839 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 03:45:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:21,410 INFO L93 Difference]: Finished difference Result 1586 states and 2654 transitions. [2025-01-09 03:45:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:21,410 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), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 69 [2025-01-09 03:45:21,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:21,417 INFO L225 Difference]: With dead ends: 1586 [2025-01-09 03:45:21,417 INFO L226 Difference]: Without dead ends: 1117 [2025-01-09 03:45:21,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:21,420 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 1898 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1815 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1958 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 1815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:21,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1958 Valid, 1397 Invalid, 2224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 1815 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 03:45:21,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-01-09 03:45:21,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 995. [2025-01-09 03:45:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 783 states have (on average 1.6743295019157087) internal successors, (1311), 813 states have internal predecessors, (1311), 174 states have call successors, (174), 36 states have call predecessors, (174), 37 states have return successors, (176), 158 states have call predecessors, (176), 169 states have call successors, (176) [2025-01-09 03:45:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1661 transitions. [2025-01-09 03:45:21,463 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1661 transitions. Word has length 69 [2025-01-09 03:45:21,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:21,463 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1661 transitions. [2025-01-09 03:45:21,463 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), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 03:45:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1661 transitions. [2025-01-09 03:45:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:45:21,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:21,466 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] [2025-01-09 03:45:21,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:45:21,466 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:21,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:21,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1859115116, now seen corresponding path program 1 times [2025-01-09 03:45:21,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:21,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665658806] [2025-01-09 03:45:21,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:21,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:21,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:45:21,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:45:21,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:21,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:21,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:21,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665658806] [2025-01-09 03:45:21,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665658806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:21,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:21,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:45:21,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560652648] [2025-01-09 03:45:21,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:21,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:45:21,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:21,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:45:21,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:21,771 INFO L87 Difference]: Start difference. First operand 995 states and 1661 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, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:45:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:23,274 INFO L93 Difference]: Finished difference Result 1953 states and 3325 transitions. [2025-01-09 03:45:23,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:45:23,274 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, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 98 [2025-01-09 03:45:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:23,281 INFO L225 Difference]: With dead ends: 1953 [2025-01-09 03:45:23,281 INFO L226 Difference]: Without dead ends: 1003 [2025-01-09 03:45:23,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:45:23,285 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1286 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:23,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 1622 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 03:45:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-01-09 03:45:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2025-01-09 03:45:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 789 states have (on average 1.6692015209125475) internal successors, (1317), 819 states have internal predecessors, (1317), 174 states have call successors, (174), 36 states have call predecessors, (174), 39 states have return successors, (208), 160 states have call predecessors, (208), 169 states have call successors, (208) [2025-01-09 03:45:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1699 transitions. [2025-01-09 03:45:23,367 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1699 transitions. Word has length 98 [2025-01-09 03:45:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:23,371 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1699 transitions. [2025-01-09 03:45:23,371 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, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:45:23,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1699 transitions. [2025-01-09 03:45:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:45:23,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:23,373 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] [2025-01-09 03:45:23,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:45:23,373 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:23,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:23,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1410699261, now seen corresponding path program 1 times [2025-01-09 03:45:23,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:23,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378976483] [2025-01-09 03:45:23,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:23,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:23,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:45:23,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:45:23,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:23,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:23,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:23,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378976483] [2025-01-09 03:45:23,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378976483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:23,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:23,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 03:45:23,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418619180] [2025-01-09 03:45:23,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:23,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 03:45:23,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:23,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 03:45:23,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:45:23,729 INFO L87 Difference]: Start difference. First operand 1003 states and 1699 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, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-01-09 03:45:28,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:28,603 INFO L93 Difference]: Finished difference Result 3628 states and 6196 transitions. [2025-01-09 03:45:28,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 03:45:28,604 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, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 98 [2025-01-09 03:45:28,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:28,618 INFO L225 Difference]: With dead ends: 3628 [2025-01-09 03:45:28,618 INFO L226 Difference]: Without dead ends: 2670 [2025-01-09 03:45:28,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 03:45:28,624 INFO L435 NwaCegarLoop]: 758 mSDtfsCounter, 2154 mSDsluCounter, 6663 mSDsCounter, 0 mSdLazyCounter, 12046 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2228 SdHoareTripleChecker+Valid, 7421 SdHoareTripleChecker+Invalid, 12628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 12046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:28,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2228 Valid, 7421 Invalid, 12628 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [582 Valid, 12046 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 03:45:28,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2025-01-09 03:45:28,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2572. [2025-01-09 03:45:28,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 1958 states have (on average 1.6389172625127681) internal successors, (3209), 2034 states have internal predecessors, (3209), 513 states have call successors, (513), 77 states have call predecessors, (513), 100 states have return successors, (612), 493 states have call predecessors, (612), 508 states have call successors, (612) [2025-01-09 03:45:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 4334 transitions. [2025-01-09 03:45:28,728 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 4334 transitions. Word has length 98 [2025-01-09 03:45:28,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:28,729 INFO L471 AbstractCegarLoop]: Abstraction has 2572 states and 4334 transitions. [2025-01-09 03:45:28,729 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, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-01-09 03:45:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 4334 transitions. [2025-01-09 03:45:28,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 03:45:28,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:28,731 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] [2025-01-09 03:45:28,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:45:28,731 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:28,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:28,732 INFO L85 PathProgramCache]: Analyzing trace with hash 569582711, now seen corresponding path program 1 times [2025-01-09 03:45:28,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:28,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435324840] [2025-01-09 03:45:28,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:28,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:28,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:45:28,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:45:28,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:28,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:28,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:28,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435324840] [2025-01-09 03:45:28,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435324840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:28,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:28,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:28,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322172118] [2025-01-09 03:45:28,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:28,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:28,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:28,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:28,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:28,896 INFO L87 Difference]: Start difference. First operand 2572 states and 4334 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 03:45:31,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:31,175 INFO L93 Difference]: Finished difference Result 8227 states and 14145 transitions. [2025-01-09 03:45:31,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 03:45:31,176 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 99 [2025-01-09 03:45:31,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:31,209 INFO L225 Difference]: With dead ends: 8227 [2025-01-09 03:45:31,210 INFO L226 Difference]: Without dead ends: 5700 [2025-01-09 03:45:31,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-01-09 03:45:31,225 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 2694 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 4301 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2763 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 4984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 683 IncrementalHoareTripleChecker+Valid, 4301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:31,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2763 Valid, 2561 Invalid, 4984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [683 Valid, 4301 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 03:45:31,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2025-01-09 03:45:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5469. [2025-01-09 03:45:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5469 states, 4158 states have (on average 1.6284271284271283) internal successors, (6771), 4339 states have internal predecessors, (6771), 1088 states have call successors, (1088), 190 states have call predecessors, (1088), 222 states have return successors, (1237), 1016 states have call predecessors, (1237), 1083 states have call successors, (1237) [2025-01-09 03:45:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 9096 transitions. [2025-01-09 03:45:31,499 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 9096 transitions. Word has length 99 [2025-01-09 03:45:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:31,500 INFO L471 AbstractCegarLoop]: Abstraction has 5469 states and 9096 transitions. [2025-01-09 03:45:31,500 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 03:45:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 9096 transitions. [2025-01-09 03:45:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:45:31,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:31,505 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:45:31,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:45:31,505 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:31,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:31,505 INFO L85 PathProgramCache]: Analyzing trace with hash 460462107, now seen corresponding path program 1 times [2025-01-09 03:45:31,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:31,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690582858] [2025-01-09 03:45:31,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:31,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:31,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:45:31,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:45:31,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:31,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:31,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:45:31,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:31,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690582858] [2025-01-09 03:45:31,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690582858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:31,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:31,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:31,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130204512] [2025-01-09 03:45:31,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:31,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:31,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:31,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:31,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:31,695 INFO L87 Difference]: Start difference. First operand 5469 states and 9096 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 03:45:34,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:34,136 INFO L93 Difference]: Finished difference Result 16548 states and 27991 transitions. [2025-01-09 03:45:34,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 03:45:34,136 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 101 [2025-01-09 03:45:34,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:34,196 INFO L225 Difference]: With dead ends: 16548 [2025-01-09 03:45:34,196 INFO L226 Difference]: Without dead ends: 11833 [2025-01-09 03:45:34,218 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:45:34,219 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 2358 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 3567 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2438 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 4069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 3567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:34,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2438 Valid, 1753 Invalid, 4069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 3567 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 03:45:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11833 states. [2025-01-09 03:45:34,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11833 to 11199. [2025-01-09 03:45:34,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11199 states, 8503 states have (on average 1.629424908855698) internal successors, (13855), 8903 states have internal predecessors, (13855), 2182 states have call successors, (2182), 372 states have call predecessors, (2182), 513 states have return successors, (2752), 2066 states have call predecessors, (2752), 2177 states have call successors, (2752) [2025-01-09 03:45:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11199 states to 11199 states and 18789 transitions. [2025-01-09 03:45:34,899 INFO L78 Accepts]: Start accepts. Automaton has 11199 states and 18789 transitions. Word has length 101 [2025-01-09 03:45:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:34,900 INFO L471 AbstractCegarLoop]: Abstraction has 11199 states and 18789 transitions. [2025-01-09 03:45:34,901 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 03:45:34,901 INFO L276 IsEmpty]: Start isEmpty. Operand 11199 states and 18789 transitions. [2025-01-09 03:45:34,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:45:34,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:34,904 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] [2025-01-09 03:45:34,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:45:34,904 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:34,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:34,905 INFO L85 PathProgramCache]: Analyzing trace with hash -602494874, now seen corresponding path program 1 times [2025-01-09 03:45:34,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:34,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944292812] [2025-01-09 03:45:34,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:34,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:34,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:45:34,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:45:34,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:34,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:35,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:35,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:35,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944292812] [2025-01-09 03:45:35,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944292812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:35,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:35,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:45:35,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223960084] [2025-01-09 03:45:35,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:35,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:45:35,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:35,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:45:35,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:45:35,037 INFO L87 Difference]: Start difference. First operand 11199 states and 18789 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:45:35,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:35,707 INFO L93 Difference]: Finished difference Result 21692 states and 36555 transitions. [2025-01-09 03:45:35,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:45:35,708 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2025-01-09 03:45:35,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:35,761 INFO L225 Difference]: With dead ends: 21692 [2025-01-09 03:45:35,762 INFO L226 Difference]: Without dead ends: 11357 [2025-01-09 03:45:35,786 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:45:35,787 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 0 mSDsluCounter, 2481 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3318 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:45:35,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3318 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:35,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11357 states. [2025-01-09 03:45:36,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11357 to 11321. [2025-01-09 03:45:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11321 states, 8599 states have (on average 1.6217001976974066) internal successors, (13945), 8993 states have internal predecessors, (13945), 2176 states have call successors, (2176), 372 states have call predecessors, (2176), 545 states have return successors, (2840), 2098 states have call predecessors, (2840), 2171 states have call successors, (2840) [2025-01-09 03:45:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11321 states to 11321 states and 18961 transitions. [2025-01-09 03:45:36,470 INFO L78 Accepts]: Start accepts. Automaton has 11321 states and 18961 transitions. Word has length 106 [2025-01-09 03:45:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:36,471 INFO L471 AbstractCegarLoop]: Abstraction has 11321 states and 18961 transitions. [2025-01-09 03:45:36,471 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:45:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 11321 states and 18961 transitions. [2025-01-09 03:45:36,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:45:36,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:36,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:36,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:45:36,474 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:36,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:36,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2006892439, now seen corresponding path program 1 times [2025-01-09 03:45:36,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:36,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055465784] [2025-01-09 03:45:36,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:36,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:36,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:45:36,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:45:36,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:36,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:36,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:36,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055465784] [2025-01-09 03:45:36,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055465784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:36,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:36,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:45:36,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264875090] [2025-01-09 03:45:36,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:36,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:45:36,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:36,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:45:36,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:45:36,675 INFO L87 Difference]: Start difference. First operand 11321 states and 18961 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, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 03:45:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:37,325 INFO L93 Difference]: Finished difference Result 23756 states and 40665 transitions. [2025-01-09 03:45:37,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:45:37,325 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, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 113 [2025-01-09 03:45:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:37,378 INFO L225 Difference]: With dead ends: 23756 [2025-01-09 03:45:37,379 INFO L226 Difference]: Without dead ends: 11593 [2025-01-09 03:45:37,412 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:45:37,414 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 235 mSDsluCounter, 5879 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 6761 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:45:37,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 6761 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:45:37,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11593 states. [2025-01-09 03:45:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11593 to 11321. [2025-01-09 03:45:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11321 states, 8599 states have (on average 1.591464123735318) internal successors, (13685), 8993 states have internal predecessors, (13685), 2176 states have call successors, (2176), 372 states have call predecessors, (2176), 545 states have return successors, (2840), 2098 states have call predecessors, (2840), 2171 states have call successors, (2840) [2025-01-09 03:45:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11321 states to 11321 states and 18701 transitions. [2025-01-09 03:45:38,003 INFO L78 Accepts]: Start accepts. Automaton has 11321 states and 18701 transitions. Word has length 113 [2025-01-09 03:45:38,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:38,004 INFO L471 AbstractCegarLoop]: Abstraction has 11321 states and 18701 transitions. [2025-01-09 03:45:38,004 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, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 03:45:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand 11321 states and 18701 transitions. [2025-01-09 03:45:38,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:45:38,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:38,008 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:38,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:45:38,008 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:38,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:38,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1544098251, now seen corresponding path program 1 times [2025-01-09 03:45:38,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:38,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397711031] [2025-01-09 03:45:38,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:38,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:38,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:45:38,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:45:38,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:38,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:38,227 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:45:38,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:38,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397711031] [2025-01-09 03:45:38,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397711031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:38,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:38,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:38,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434331781] [2025-01-09 03:45:38,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:38,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:38,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:38,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:38,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:38,230 INFO L87 Difference]: Start difference. First operand 11321 states and 18701 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:45:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:41,155 INFO L93 Difference]: Finished difference Result 23247 states and 38602 transitions. [2025-01-09 03:45:41,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:45:41,156 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), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 118 [2025-01-09 03:45:41,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:41,336 INFO L225 Difference]: With dead ends: 23247 [2025-01-09 03:45:41,337 INFO L226 Difference]: Without dead ends: 12801 [2025-01-09 03:45:41,531 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:45:41,536 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 2075 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 3074 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2151 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 3555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 3074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:41,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2151 Valid, 1700 Invalid, 3555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 3074 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 03:45:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12801 states. [2025-01-09 03:45:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12801 to 11887. [2025-01-09 03:45:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11887 states, 9021 states have (on average 1.578206407271921) internal successors, (14237), 9451 states have internal predecessors, (14237), 2231 states have call successors, (2231), 425 states have call predecessors, (2231), 634 states have return successors, (3043), 2154 states have call predecessors, (3043), 2226 states have call successors, (3043) [2025-01-09 03:45:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11887 states to 11887 states and 19511 transitions. [2025-01-09 03:45:42,012 INFO L78 Accepts]: Start accepts. Automaton has 11887 states and 19511 transitions. Word has length 118 [2025-01-09 03:45:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:42,013 INFO L471 AbstractCegarLoop]: Abstraction has 11887 states and 19511 transitions. [2025-01-09 03:45:42,013 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), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:45:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 11887 states and 19511 transitions. [2025-01-09 03:45:42,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:45:42,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:42,016 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] [2025-01-09 03:45:42,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:45:42,017 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:42,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:42,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1087499594, now seen corresponding path program 1 times [2025-01-09 03:45:42,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:42,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547092237] [2025-01-09 03:45:42,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:42,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:42,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:45:42,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:45:42,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:42,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:42,176 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:45:42,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:42,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547092237] [2025-01-09 03:45:42,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547092237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:42,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:42,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:42,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924655486] [2025-01-09 03:45:42,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:42,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:42,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:42,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:42,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:42,179 INFO L87 Difference]: Start difference. First operand 11887 states and 19511 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:45:42,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:42,992 INFO L93 Difference]: Finished difference Result 12036 states and 19773 transitions. [2025-01-09 03:45:42,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:45:42,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-01-09 03:45:42,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:43,056 INFO L225 Difference]: With dead ends: 12036 [2025-01-09 03:45:43,056 INFO L226 Difference]: Without dead ends: 12021 [2025-01-09 03:45:43,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:43,067 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 900 mSDsluCounter, 2116 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 2935 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:43,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 2935 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:45:43,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12021 states. [2025-01-09 03:45:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12021 to 11895. [2025-01-09 03:45:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11895 states, 9029 states have (on average 1.5776940967992026) internal successors, (14245), 9459 states have internal predecessors, (14245), 2231 states have call successors, (2231), 425 states have call predecessors, (2231), 634 states have return successors, (3043), 2154 states have call predecessors, (3043), 2226 states have call successors, (3043) [2025-01-09 03:45:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11895 states to 11895 states and 19519 transitions. [2025-01-09 03:45:43,491 INFO L78 Accepts]: Start accepts. Automaton has 11895 states and 19519 transitions. Word has length 123 [2025-01-09 03:45:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:43,491 INFO L471 AbstractCegarLoop]: Abstraction has 11895 states and 19519 transitions. [2025-01-09 03:45:43,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:45:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 11895 states and 19519 transitions. [2025-01-09 03:45:43,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:45:43,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:43,494 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] [2025-01-09 03:45:43,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 03:45:43,495 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:43,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:43,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1601463845, now seen corresponding path program 1 times [2025-01-09 03:45:43,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:43,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6316315] [2025-01-09 03:45:43,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:43,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:43,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:45:43,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:45:43,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:43,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:43,705 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:45:43,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:43,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6316315] [2025-01-09 03:45:43,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6316315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:43,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:43,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 03:45:43,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073169544] [2025-01-09 03:45:43,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:43,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:45:43,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:43,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:45:43,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:45:43,706 INFO L87 Difference]: Start difference. First operand 11895 states and 19519 transitions. Second operand has 11 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 4 states have call successors, (15), 2 states have call predecessors, (15), 6 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:45:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:44,447 INFO L93 Difference]: Finished difference Result 12256 states and 20071 transitions. [2025-01-09 03:45:44,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:45:44,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 4 states have call successors, (15), 2 states have call predecessors, (15), 6 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 129 [2025-01-09 03:45:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:44,505 INFO L225 Difference]: With dead ends: 12256 [2025-01-09 03:45:44,505 INFO L226 Difference]: Without dead ends: 12241 [2025-01-09 03:45:44,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-01-09 03:45:44,517 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 823 mSDsluCounter, 6483 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 7303 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:44,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 7303 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:45:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12241 states. [2025-01-09 03:45:44,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12241 to 12203. [2025-01-09 03:45:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12203 states, 9266 states have (on average 1.5731707317073171) internal successors, (14577), 9696 states have internal predecessors, (14577), 2276 states have call successors, (2276), 451 states have call predecessors, (2276), 660 states have return successors, (3128), 2198 states have call predecessors, (3128), 2271 states have call successors, (3128) [2025-01-09 03:45:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12203 states to 12203 states and 19981 transitions. [2025-01-09 03:45:44,986 INFO L78 Accepts]: Start accepts. Automaton has 12203 states and 19981 transitions. Word has length 129 [2025-01-09 03:45:44,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:44,987 INFO L471 AbstractCegarLoop]: Abstraction has 12203 states and 19981 transitions. [2025-01-09 03:45:44,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 4 states have call successors, (15), 2 states have call predecessors, (15), 6 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:45:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 12203 states and 19981 transitions. [2025-01-09 03:45:44,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 03:45:44,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:44,991 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:44,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 03:45:44,991 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:44,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:44,992 INFO L85 PathProgramCache]: Analyzing trace with hash -333092465, now seen corresponding path program 1 times [2025-01-09 03:45:44,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:44,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221770696] [2025-01-09 03:45:44,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:44,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:45,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 03:45:45,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 03:45:45,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:45,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 03:45:45,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:45,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221770696] [2025-01-09 03:45:45,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221770696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:45,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:45,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:45:45,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577178274] [2025-01-09 03:45:45,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:45,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:45:45,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:45,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:45:45,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:45,323 INFO L87 Difference]: Start difference. First operand 12203 states and 19981 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 7 states have internal predecessors, (104), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:45:47,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:47,097 INFO L93 Difference]: Finished difference Result 24423 states and 40170 transitions. [2025-01-09 03:45:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:45:47,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 7 states have internal predecessors, (104), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) Word has length 140 [2025-01-09 03:45:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:47,159 INFO L225 Difference]: With dead ends: 24423 [2025-01-09 03:45:47,159 INFO L226 Difference]: Without dead ends: 12277 [2025-01-09 03:45:47,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:45:47,207 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 1234 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 2598 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 2598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:47,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 1618 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 2598 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 03:45:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12277 states. [2025-01-09 03:45:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12277 to 12203. [2025-01-09 03:45:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12203 states, 9266 states have (on average 1.571120224476581) internal successors, (14558), 9696 states have internal predecessors, (14558), 2276 states have call successors, (2276), 451 states have call predecessors, (2276), 660 states have return successors, (3128), 2198 states have call predecessors, (3128), 2271 states have call successors, (3128) [2025-01-09 03:45:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12203 states to 12203 states and 19962 transitions. [2025-01-09 03:45:47,913 INFO L78 Accepts]: Start accepts. Automaton has 12203 states and 19962 transitions. Word has length 140 [2025-01-09 03:45:47,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:47,914 INFO L471 AbstractCegarLoop]: Abstraction has 12203 states and 19962 transitions. [2025-01-09 03:45:47,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 7 states have internal predecessors, (104), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:45:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 12203 states and 19962 transitions. [2025-01-09 03:45:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 03:45:47,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:47,918 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:47,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 03:45:47,918 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:47,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:47,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1992408197, now seen corresponding path program 1 times [2025-01-09 03:45:47,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:47,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65787531] [2025-01-09 03:45:47,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:47,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:47,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 03:45:47,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 03:45:47,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:47,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 03:45:48,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:48,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65787531] [2025-01-09 03:45:48,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65787531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:48,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:48,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 03:45:48,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548526516] [2025-01-09 03:45:48,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:48,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:45:48,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:48,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:45:48,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:45:48,235 INFO L87 Difference]: Start difference. First operand 12203 states and 19962 transitions. Second operand has 13 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 7 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 03:45:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:52,094 INFO L93 Difference]: Finished difference Result 28093 states and 45926 transitions. [2025-01-09 03:45:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 03:45:52,095 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 7 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 143 [2025-01-09 03:45:52,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:52,171 INFO L225 Difference]: With dead ends: 28093 [2025-01-09 03:45:52,171 INFO L226 Difference]: Without dead ends: 16680 [2025-01-09 03:45:52,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2025-01-09 03:45:52,215 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 2983 mSDsluCounter, 3542 mSDsCounter, 0 mSdLazyCounter, 7356 mSolverCounterSat, 706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3068 SdHoareTripleChecker+Valid, 3957 SdHoareTripleChecker+Invalid, 8062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 706 IncrementalHoareTripleChecker+Valid, 7356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:52,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3068 Valid, 3957 Invalid, 8062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [706 Valid, 7356 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 03:45:52,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16680 states. [2025-01-09 03:45:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16680 to 15119. [2025-01-09 03:45:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15119 states, 11570 states have (on average 1.5522904062229905) internal successors, (17960), 12114 states have internal predecessors, (17960), 2642 states have call successors, (2642), 625 states have call predecessors, (2642), 906 states have return successors, (3656), 2522 states have call predecessors, (3656), 2637 states have call successors, (3656) [2025-01-09 03:45:52,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15119 states to 15119 states and 24258 transitions. [2025-01-09 03:45:52,836 INFO L78 Accepts]: Start accepts. Automaton has 15119 states and 24258 transitions. Word has length 143 [2025-01-09 03:45:52,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:52,836 INFO L471 AbstractCegarLoop]: Abstraction has 15119 states and 24258 transitions. [2025-01-09 03:45:52,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 7 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 03:45:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 15119 states and 24258 transitions. [2025-01-09 03:45:52,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 03:45:52,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:52,839 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:52,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 03:45:52,840 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:52,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:52,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1783709894, now seen corresponding path program 1 times [2025-01-09 03:45:52,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:52,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889785226] [2025-01-09 03:45:52,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:52,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:52,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 03:45:52,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 03:45:52,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:52,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 03:45:52,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:52,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889785226] [2025-01-09 03:45:52,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889785226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:52,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:52,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:45:52,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704559934] [2025-01-09 03:45:52,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:52,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:45:52,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:52,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:45:52,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:45:52,964 INFO L87 Difference]: Start difference. First operand 15119 states and 24258 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 03:45:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:55,944 INFO L93 Difference]: Finished difference Result 44424 states and 72696 transitions. [2025-01-09 03:45:55,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:55,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 143 [2025-01-09 03:45:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:56,091 INFO L225 Difference]: With dead ends: 44424 [2025-01-09 03:45:56,091 INFO L226 Difference]: Without dead ends: 29326 [2025-01-09 03:45:56,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:56,158 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 2166 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 2226 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2261 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 2226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:56,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2261 Valid, 1425 Invalid, 2713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 2226 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 03:45:56,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29326 states. [2025-01-09 03:45:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29326 to 27745. [2025-01-09 03:45:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27745 states, 20746 states have (on average 1.5457919598958836) internal successors, (32069), 21891 states have internal predecessors, (32069), 5416 states have call successors, (5416), 1049 states have call predecessors, (5416), 1582 states have return successors, (7774), 5298 states have call predecessors, (7774), 5411 states have call successors, (7774) [2025-01-09 03:45:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27745 states to 27745 states and 45259 transitions. [2025-01-09 03:45:57,526 INFO L78 Accepts]: Start accepts. Automaton has 27745 states and 45259 transitions. Word has length 143 [2025-01-09 03:45:57,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:57,527 INFO L471 AbstractCegarLoop]: Abstraction has 27745 states and 45259 transitions. [2025-01-09 03:45:57,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 03:45:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 27745 states and 45259 transitions. [2025-01-09 03:45:57,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 03:45:57,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:57,530 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:57,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 03:45:57,530 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:57,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:57,531 INFO L85 PathProgramCache]: Analyzing trace with hash 265768133, now seen corresponding path program 1 times [2025-01-09 03:45:57,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:57,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756919690] [2025-01-09 03:45:57,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:57,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:57,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 03:45:57,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 03:45:57,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:57,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:45:57,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:57,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756919690] [2025-01-09 03:45:57,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756919690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:57,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:57,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:57,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399185523] [2025-01-09 03:45:57,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:57,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:57,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:57,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:57,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:57,634 INFO L87 Difference]: Start difference. First operand 27745 states and 45259 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 03:46:01,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:01,713 INFO L93 Difference]: Finished difference Result 82114 states and 138377 transitions. [2025-01-09 03:46:01,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:46:01,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 149 [2025-01-09 03:46:01,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:01,987 INFO L225 Difference]: With dead ends: 82114 [2025-01-09 03:46:01,988 INFO L226 Difference]: Without dead ends: 54414 [2025-01-09 03:46:02,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:46:02,102 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 1845 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1917 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:02,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1917 Valid, 948 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 03:46:02,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54414 states. [2025-01-09 03:46:04,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54414 to 52513. [2025-01-09 03:46:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52513 states, 38398 states have (on average 1.5408354601802177) internal successors, (59165), 40763 states have internal predecessors, (59165), 11236 states have call successors, (11236), 1808 states have call predecessors, (11236), 2878 states have return successors, (18240), 11189 states have call predecessors, (18240), 11231 states have call successors, (18240) [2025-01-09 03:46:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52513 states to 52513 states and 88641 transitions. [2025-01-09 03:46:05,441 INFO L78 Accepts]: Start accepts. Automaton has 52513 states and 88641 transitions. Word has length 149 [2025-01-09 03:46:05,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:05,441 INFO L471 AbstractCegarLoop]: Abstraction has 52513 states and 88641 transitions. [2025-01-09 03:46:05,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 03:46:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 52513 states and 88641 transitions. [2025-01-09 03:46:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 03:46:05,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:05,446 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:05,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 03:46:05,446 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:05,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:05,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1450938138, now seen corresponding path program 1 times [2025-01-09 03:46:05,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:05,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916874808] [2025-01-09 03:46:05,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:05,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:05,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 03:46:05,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 03:46:05,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:05,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:46:05,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:05,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916874808] [2025-01-09 03:46:05,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916874808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:05,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:05,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:05,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963313630] [2025-01-09 03:46:05,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:05,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:05,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:05,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:05,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:05,553 INFO L87 Difference]: Start difference. First operand 52513 states and 88641 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 4 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:46:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:14,439 INFO L93 Difference]: Finished difference Result 165784 states and 294784 transitions. [2025-01-09 03:46:14,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:46:14,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 4 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 152 [2025-01-09 03:46:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:15,272 INFO L225 Difference]: With dead ends: 165784 [2025-01-09 03:46:15,272 INFO L226 Difference]: Without dead ends: 113316 [2025-01-09 03:46:15,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:46:15,516 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 1842 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1911 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:15,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1911 Valid, 914 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 03:46:15,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113316 states. [2025-01-09 03:46:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113316 to 109553. [2025-01-09 03:46:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109553 states, 78090 states have (on average 1.5364195159431426) internal successors, (119979), 83416 states have internal predecessors, (119979), 25779 states have call successors, (25779), 3326 states have call predecessors, (25779), 5683 states have return successors, (49281), 26034 states have call predecessors, (49281), 25774 states have call successors, (49281) [2025-01-09 03:46:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109553 states to 109553 states and 195039 transitions. [2025-01-09 03:46:23,295 INFO L78 Accepts]: Start accepts. Automaton has 109553 states and 195039 transitions. Word has length 152 [2025-01-09 03:46:23,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:23,295 INFO L471 AbstractCegarLoop]: Abstraction has 109553 states and 195039 transitions. [2025-01-09 03:46:23,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 4 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:46:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 109553 states and 195039 transitions. [2025-01-09 03:46:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 03:46:23,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:23,304 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:23,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 03:46:23,304 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:23,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:23,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1995976775, now seen corresponding path program 1 times [2025-01-09 03:46:23,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:23,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552106905] [2025-01-09 03:46:23,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:23,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:23,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 03:46:23,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 03:46:23,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:23,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:46:23,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:23,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552106905] [2025-01-09 03:46:23,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552106905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:23,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:23,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:23,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849745732] [2025-01-09 03:46:23,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:23,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:23,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:23,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:23,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:23,564 INFO L87 Difference]: Start difference. First operand 109553 states and 195039 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16)