./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product18.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_product18.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 4d9d31939acfea5ee9b43b1f06257671943c7251c27c351c5e445aa6495fd098 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:44:20,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:44:20,301 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:44:20,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:44:20,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:44:20,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:44:20,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:44:20,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:44:20,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:44:20,321 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:44:20,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:44:20,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:44:20,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:44:20,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:44:20,321 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:44:20,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:44:20,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:44:20,322 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:44:20,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:44:20,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:44:20,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:44:20,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:44:20,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:44:20,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:44:20,322 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:44:20,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:44:20,322 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:44:20,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:44:20,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:44:20,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:44:20,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:44:20,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:44:20,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:44:20,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:44:20,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:44:20,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:44:20,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:44:20,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:44:20,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:44:20,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:44:20,323 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:44:20,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:44:20,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:44:20,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:44:20,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:44:20,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:44:20,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:44:20,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:44:20,323 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 -> 4d9d31939acfea5ee9b43b1f06257671943c7251c27c351c5e445aa6495fd098 [2025-01-09 03:44:20,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:44:20,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:44:20,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:44:20,588 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:44:20,589 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:44:20,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c [2025-01-09 03:44:21,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dafeeca37/202283a79fbc4ddaaa37d5c108019cdc/FLAGa16c00fd7 [2025-01-09 03:44:22,119 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:44:22,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c [2025-01-09 03:44:22,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dafeeca37/202283a79fbc4ddaaa37d5c108019cdc/FLAGa16c00fd7 [2025-01-09 03:44:22,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dafeeca37/202283a79fbc4ddaaa37d5c108019cdc [2025-01-09 03:44:22,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:44:22,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:44:22,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:44:22,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:44:22,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:44:22,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:44:22" (1/1) ... [2025-01-09 03:44:22,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1a7767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:22, skipping insertion in model container [2025-01-09 03:44:22,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:44:22" (1/1) ... [2025-01-09 03:44:22,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:44:22,517 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_product18.cil.c[38051,38064] [2025-01-09 03:44:22,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:44:22,669 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:44:22,676 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2025-01-09 03:44:22,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [150] [2025-01-09 03:44:22,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [164] [2025-01-09 03:44:22,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [284] [2025-01-09 03:44:22,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [322] [2025-01-09 03:44:22,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1825] [2025-01-09 03:44:22,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1834] [2025-01-09 03:44:22,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2200] [2025-01-09 03:44:22,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2552] [2025-01-09 03:44:22,680 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2733] [2025-01-09 03:44:22,732 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_product18.cil.c[38051,38064] [2025-01-09 03:44:22,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:44:22,800 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:44:22,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:22 WrapperNode [2025-01-09 03:44:22,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:44:22,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:44:22,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:44:22,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:44:22,812 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:44:22" (1/1) ... [2025-01-09 03:44:22,853 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:44:22" (1/1) ... [2025-01-09 03:44:22,935 INFO L138 Inliner]: procedures = 92, calls = 338, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 813 [2025-01-09 03:44:22,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:44:22,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:44:22,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:44:22,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:44:22,952 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:22" (1/1) ... [2025-01-09 03:44:22,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:22" (1/1) ... [2025-01-09 03:44:22,958 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:22" (1/1) ... [2025-01-09 03:44:22,991 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:44:22,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:22" (1/1) ... [2025-01-09 03:44:22,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:22" (1/1) ... [2025-01-09 03:44:23,005 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:22" (1/1) ... [2025-01-09 03:44:23,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:22" (1/1) ... [2025-01-09 03:44:23,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:22" (1/1) ... [2025-01-09 03:44:23,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:22" (1/1) ... [2025-01-09 03:44:23,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:22" (1/1) ... [2025-01-09 03:44:23,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:44:23,039 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:44:23,043 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:44:23,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:44:23,045 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:22" (1/1) ... [2025-01-09 03:44:23,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:44:23,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:44:23,075 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:44:23,078 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:44:23,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:44:23,099 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:44:23,100 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:44:23,100 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-01-09 03:44:23,100 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-01-09 03:44:23,100 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:44:23,100 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:44:23,100 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:44:23,100 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:44:23,100 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:44:23,100 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:44:23,101 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:44:23,101 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:44:23,101 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:44:23,101 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:44:23,102 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-01-09 03:44:23,102 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-01-09 03:44:23,102 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:44:23,102 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:44:23,102 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:44:23,102 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:44:23,102 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:44:23,102 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:44:23,102 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:44:23,102 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:44:23,102 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:44:23,102 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:44:23,102 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:44:23,102 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:44:23,103 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:44:23,103 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:44:23,103 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:44:23,104 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:44:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:44:23,104 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:44:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2025-01-09 03:44:23,105 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:44:23,105 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:44:23,105 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:44:23,105 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:44:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:44:23,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:44:23,106 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:44:23,106 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:44:23,266 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:44:23,269 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:44:24,328 INFO L? ?]: Removed 429 outVars from TransFormulas that were not future-live. [2025-01-09 03:44:24,329 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:44:24,342 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:44:24,342 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:44:24,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:24 BoogieIcfgContainer [2025-01-09 03:44:24,342 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:44:24,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:44:24,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:44:24,347 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:44:24,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:44:22" (1/3) ... [2025-01-09 03:44:24,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649ff492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:24, skipping insertion in model container [2025-01-09 03:44:24,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:22" (2/3) ... [2025-01-09 03:44:24,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649ff492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:24, skipping insertion in model container [2025-01-09 03:44:24,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:24" (3/3) ... [2025-01-09 03:44:24,348 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product18.cil.c [2025-01-09 03:44:24,358 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:44:24,360 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product18.cil.c that has 23 procedures, 540 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:44:24,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:44:24,425 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;@16e9e6a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:44:24,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:44:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 540 states, 425 states have (on average 1.7058823529411764) internal successors, (725), 448 states have internal predecessors, (725), 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:44:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 03:44:24,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:24,443 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:44:24,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:24,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:24,449 INFO L85 PathProgramCache]: Analyzing trace with hash -805983255, now seen corresponding path program 1 times [2025-01-09 03:44:24,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:24,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83010289] [2025-01-09 03:44:24,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:24,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:24,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 03:44:24,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 03:44:24,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:24,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:24,886 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:44:24,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:24,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83010289] [2025-01-09 03:44:24,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83010289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:24,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:24,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:24,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819849143] [2025-01-09 03:44:24,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:24,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:24,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:24,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:24,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:24,911 INFO L87 Difference]: Start difference. First operand has 540 states, 425 states have (on average 1.7058823529411764) internal successors, (725), 448 states have internal predecessors, (725), 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:44:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:25,045 INFO L93 Difference]: Finished difference Result 1060 states and 1789 transitions. [2025-01-09 03:44:25,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:25,047 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:44:25,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:25,062 INFO L225 Difference]: With dead ends: 1060 [2025-01-09 03:44:25,062 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 03:44:25,067 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:44:25,069 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 5 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2657 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:44:25,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2657 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 03:44:25,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-01-09 03:44:25,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.704057279236277) internal successors, (714), 440 states have internal predecessors, (714), 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:44:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 891 transitions. [2025-01-09 03:44:25,132 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 891 transitions. Word has length 56 [2025-01-09 03:44:25,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:25,133 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 891 transitions. [2025-01-09 03:44:25,133 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:44:25,134 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 891 transitions. [2025-01-09 03:44:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 03:44:25,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:25,136 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:44:25,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:44:25,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:25,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:25,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1643274286, now seen corresponding path program 1 times [2025-01-09 03:44:25,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:25,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529673958] [2025-01-09 03:44:25,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:25,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:25,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 03:44:25,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 03:44:25,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:25,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:25,280 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:44:25,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:25,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529673958] [2025-01-09 03:44:25,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529673958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:25,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:25,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:25,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620948857] [2025-01-09 03:44:25,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:25,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:25,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:25,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:25,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:25,283 INFO L87 Difference]: Start difference. First operand 532 states and 891 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:44:25,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:25,328 INFO L93 Difference]: Finished difference Result 1046 states and 1759 transitions. [2025-01-09 03:44:25,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:25,329 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:44:25,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:25,333 INFO L225 Difference]: With dead ends: 1046 [2025-01-09 03:44:25,333 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 03:44:25,335 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:44:25,335 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 4 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2636 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:44:25,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2636 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:25,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 03:44:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-01-09 03:44:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.701670644391408) internal successors, (713), 440 states have internal predecessors, (713), 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:44:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 890 transitions. [2025-01-09 03:44:25,369 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 890 transitions. Word has length 58 [2025-01-09 03:44:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:25,371 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 890 transitions. [2025-01-09 03:44:25,371 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:44:25,371 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 890 transitions. [2025-01-09 03:44:25,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 03:44:25,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:25,375 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:44:25,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:44:25,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:25,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:25,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1406641738, now seen corresponding path program 1 times [2025-01-09 03:44:25,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:25,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124851812] [2025-01-09 03:44:25,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:25,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:25,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 03:44:25,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 03:44:25,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:25,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:25,573 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:44:25,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:25,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124851812] [2025-01-09 03:44:25,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124851812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:25,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:25,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:25,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672299089] [2025-01-09 03:44:25,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:25,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:25,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:25,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:25,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:25,575 INFO L87 Difference]: Start difference. First operand 532 states and 890 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:44:25,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:25,636 INFO L93 Difference]: Finished difference Result 1046 states and 1758 transitions. [2025-01-09 03:44:25,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:25,636 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:44:25,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:25,642 INFO L225 Difference]: With dead ends: 1046 [2025-01-09 03:44:25,642 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 03:44:25,644 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:44:25,645 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 3 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2636 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:44:25,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2636 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 03:44:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-01-09 03:44:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.6992840095465394) internal successors, (712), 440 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:44:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 889 transitions. [2025-01-09 03:44:25,677 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 889 transitions. Word has length 59 [2025-01-09 03:44:25,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:25,677 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 889 transitions. [2025-01-09 03:44:25,678 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:44:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 889 transitions. [2025-01-09 03:44:25,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 03:44:25,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:25,679 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:44:25,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:44:25,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:25,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:25,680 INFO L85 PathProgramCache]: Analyzing trace with hash -873994666, now seen corresponding path program 1 times [2025-01-09 03:44:25,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:25,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911844353] [2025-01-09 03:44:25,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:25,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:25,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 03:44:25,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 03:44:25,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:25,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:25,828 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:44:25,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:25,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911844353] [2025-01-09 03:44:25,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911844353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:25,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:25,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:25,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402413889] [2025-01-09 03:44:25,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:25,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:25,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:25,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:25,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:25,830 INFO L87 Difference]: Start difference. First operand 532 states and 889 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:44:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:25,873 INFO L93 Difference]: Finished difference Result 1046 states and 1757 transitions. [2025-01-09 03:44:25,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:25,874 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:44:25,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:25,879 INFO L225 Difference]: With dead ends: 1046 [2025-01-09 03:44:25,879 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 03:44:25,882 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:44:25,883 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 2 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2636 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:44:25,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2636 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:25,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 03:44:25,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-01-09 03:44:25,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.6968973747016707) internal successors, (711), 440 states have internal predecessors, (711), 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:44:25,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 888 transitions. [2025-01-09 03:44:25,908 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 888 transitions. Word has length 60 [2025-01-09 03:44:25,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:25,909 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 888 transitions. [2025-01-09 03:44:25,909 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:44:25,909 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 888 transitions. [2025-01-09 03:44:25,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 03:44:25,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:25,911 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:44:25,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:44:25,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:25,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:25,912 INFO L85 PathProgramCache]: Analyzing trace with hash 245168058, now seen corresponding path program 1 times [2025-01-09 03:44:25,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:25,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102831048] [2025-01-09 03:44:25,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:25,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:25,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 03:44:25,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 03:44:25,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:25,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:26,042 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:44:26,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:26,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102831048] [2025-01-09 03:44:26,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102831048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:26,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:26,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:26,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086234207] [2025-01-09 03:44:26,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:26,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:26,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:26,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:26,045 INFO L87 Difference]: Start difference. First operand 532 states and 888 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:44:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:26,092 INFO L93 Difference]: Finished difference Result 1046 states and 1756 transitions. [2025-01-09 03:44:26,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:26,092 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:44:26,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:26,098 INFO L225 Difference]: With dead ends: 1046 [2025-01-09 03:44:26,098 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 03:44:26,100 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:44:26,102 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 1 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2636 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:44:26,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2636 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:26,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 03:44:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-01-09 03:44:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.694510739856802) internal successors, (710), 440 states have internal predecessors, (710), 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:44:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 887 transitions. [2025-01-09 03:44:26,134 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 887 transitions. Word has length 61 [2025-01-09 03:44:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:26,135 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 887 transitions. [2025-01-09 03:44:26,135 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:44:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 887 transitions. [2025-01-09 03:44:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 03:44:26,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:26,137 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:44:26,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:44:26,137 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:26,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:26,138 INFO L85 PathProgramCache]: Analyzing trace with hash 665706331, now seen corresponding path program 1 times [2025-01-09 03:44:26,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:26,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107704570] [2025-01-09 03:44:26,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:26,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 03:44:26,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 03:44:26,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:26,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:26,241 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:44:26,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:26,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107704570] [2025-01-09 03:44:26,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107704570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:26,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:26,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:26,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88550473] [2025-01-09 03:44:26,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:26,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:26,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:26,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:26,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:26,243 INFO L87 Difference]: Start difference. First operand 532 states and 887 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:44:26,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:26,284 INFO L93 Difference]: Finished difference Result 1046 states and 1755 transitions. [2025-01-09 03:44:26,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:26,284 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:44:26,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:26,289 INFO L225 Difference]: With dead ends: 1046 [2025-01-09 03:44:26,289 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 03:44:26,291 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:44:26,292 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 0 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2636 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:44:26,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2636 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:26,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 03:44:26,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-01-09 03:44:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.692124105011933) internal successors, (709), 440 states have internal predecessors, (709), 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:44:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 886 transitions. [2025-01-09 03:44:26,313 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 886 transitions. Word has length 62 [2025-01-09 03:44:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:26,313 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 886 transitions. [2025-01-09 03:44:26,313 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:44:26,314 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 886 transitions. [2025-01-09 03:44:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 03:44:26,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:26,315 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:44:26,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:44:26,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:26,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:26,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1928520486, now seen corresponding path program 1 times [2025-01-09 03:44:26,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:26,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682121524] [2025-01-09 03:44:26,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:26,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:26,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 03:44:26,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 03:44:26,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:26,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:26,523 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:44:26,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:26,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682121524] [2025-01-09 03:44:26,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682121524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:26,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:26,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:26,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039200714] [2025-01-09 03:44:26,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:26,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:26,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:26,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:26,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:26,525 INFO L87 Difference]: Start difference. First operand 532 states and 886 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:44:26,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:26,649 INFO L93 Difference]: Finished difference Result 1006 states and 1679 transitions. [2025-01-09 03:44:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:44:26,649 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:44:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:26,653 INFO L225 Difference]: With dead ends: 1006 [2025-01-09 03:44:26,653 INFO L226 Difference]: Without dead ends: 526 [2025-01-09 03:44:26,655 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:44:26,656 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 91 mSDsluCounter, 4288 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5162 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:26,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5162 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-01-09 03:44:26,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-01-09 03:44:26,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 413 states have (on average 1.685230024213075) internal successors, (696), 434 states have internal predecessors, (696), 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:44:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 873 transitions. [2025-01-09 03:44:26,671 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 873 transitions. Word has length 62 [2025-01-09 03:44:26,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:26,672 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 873 transitions. [2025-01-09 03:44:26,672 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:44:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 873 transitions. [2025-01-09 03:44:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 03:44:26,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:26,673 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:44:26,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:44:26,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:26,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:26,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1639825112, now seen corresponding path program 1 times [2025-01-09 03:44:26,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:26,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339866629] [2025-01-09 03:44:26,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:26,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:26,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 03:44:26,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 03:44:26,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:26,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:26,786 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:44:26,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:26,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339866629] [2025-01-09 03:44:26,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339866629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:26,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:26,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:26,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091832433] [2025-01-09 03:44:26,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:26,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:26,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:26,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:26,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:26,789 INFO L87 Difference]: Start difference. First operand 526 states and 873 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:44:26,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:26,968 INFO L93 Difference]: Finished difference Result 1009 states and 1680 transitions. [2025-01-09 03:44:26,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:26,969 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:44:26,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:26,973 INFO L225 Difference]: With dead ends: 1009 [2025-01-09 03:44:26,973 INFO L226 Difference]: Without dead ends: 535 [2025-01-09 03:44:26,975 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:44:26,976 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 55 mSDsluCounter, 3291 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4121 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:44:26,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4121 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:26,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-01-09 03:44:26,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2025-01-09 03:44:26,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 413 states have (on average 1.675544794188862) internal successors, (692), 434 states have internal predecessors, (692), 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:44:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 869 transitions. [2025-01-09 03:44:26,993 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 869 transitions. Word has length 63 [2025-01-09 03:44:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:26,994 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 869 transitions. [2025-01-09 03:44:26,994 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:44:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 869 transitions. [2025-01-09 03:44:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 03:44:26,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:26,995 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:44:26,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:44:26,995 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:26,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:26,996 INFO L85 PathProgramCache]: Analyzing trace with hash 139769879, now seen corresponding path program 1 times [2025-01-09 03:44:26,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:26,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341897314] [2025-01-09 03:44:26,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:26,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:27,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 03:44:27,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 03:44:27,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:27,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:27,098 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:44:27,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:27,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341897314] [2025-01-09 03:44:27,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341897314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:27,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:27,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127220483] [2025-01-09 03:44:27,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:27,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:27,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:27,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:27,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:27,100 INFO L87 Difference]: Start difference. First operand 526 states and 869 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:44:27,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:27,265 INFO L93 Difference]: Finished difference Result 1009 states and 1676 transitions. [2025-01-09 03:44:27,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:27,266 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:44:27,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:27,269 INFO L225 Difference]: With dead ends: 1009 [2025-01-09 03:44:27,269 INFO L226 Difference]: Without dead ends: 535 [2025-01-09 03:44:27,271 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:44:27,271 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 54 mSDsluCounter, 3291 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4121 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:44:27,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4121 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:27,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-01-09 03:44:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2025-01-09 03:44:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 413 states have (on average 1.665859564164649) internal successors, (688), 434 states have internal predecessors, (688), 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:44:27,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 865 transitions. [2025-01-09 03:44:27,284 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 865 transitions. Word has length 64 [2025-01-09 03:44:27,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:27,285 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 865 transitions. [2025-01-09 03:44:27,285 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:44:27,285 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 865 transitions. [2025-01-09 03:44:27,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 03:44:27,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:27,286 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:44:27,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:44:27,286 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:27,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:27,287 INFO L85 PathProgramCache]: Analyzing trace with hash -953274845, now seen corresponding path program 1 times [2025-01-09 03:44:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:27,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432423887] [2025-01-09 03:44:27,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:27,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:27,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 03:44:27,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 03:44:27,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:27,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:27,367 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:44:27,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:27,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432423887] [2025-01-09 03:44:27,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432423887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:27,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:27,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:27,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735197112] [2025-01-09 03:44:27,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:27,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:27,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:27,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:27,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:27,368 INFO L87 Difference]: Start difference. First operand 526 states and 865 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:44:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:27,488 INFO L93 Difference]: Finished difference Result 1009 states and 1672 transitions. [2025-01-09 03:44:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:27,489 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:44:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:27,492 INFO L225 Difference]: With dead ends: 1009 [2025-01-09 03:44:27,492 INFO L226 Difference]: Without dead ends: 535 [2025-01-09 03:44:27,494 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:44:27,494 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 53 mSDsluCounter, 3274 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4103 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:44:27,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4103 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:44:27,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-01-09 03:44:27,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2025-01-09 03:44:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 413 states have (on average 1.6561743341404358) internal successors, (684), 434 states have internal predecessors, (684), 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:44:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 861 transitions. [2025-01-09 03:44:27,508 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 861 transitions. Word has length 65 [2025-01-09 03:44:27,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:27,511 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 861 transitions. [2025-01-09 03:44:27,512 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:44:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 861 transitions. [2025-01-09 03:44:27,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 03:44:27,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:27,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:44:27,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:44:27,513 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:27,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:27,513 INFO L85 PathProgramCache]: Analyzing trace with hash -268828253, now seen corresponding path program 1 times [2025-01-09 03:44:27,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:27,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744299728] [2025-01-09 03:44:27,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:27,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:27,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 03:44:27,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 03:44:27,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:27,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:27,616 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:44:27,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:27,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744299728] [2025-01-09 03:44:27,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744299728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:27,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:27,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:27,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891088897] [2025-01-09 03:44:27,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:27,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:27,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:27,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:27,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:27,621 INFO L87 Difference]: Start difference. First operand 526 states and 861 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:44:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:27,709 INFO L93 Difference]: Finished difference Result 1000 states and 1654 transitions. [2025-01-09 03:44:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:44:27,717 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:44:27,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:27,721 INFO L225 Difference]: With dead ends: 1000 [2025-01-09 03:44:27,721 INFO L226 Difference]: Without dead ends: 505 [2025-01-09 03:44:27,722 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:44:27,723 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 84 mSDsluCounter, 4177 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5027 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:44:27,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5027 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-01-09 03:44:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-01-09 03:44:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 392 states have (on average 1.6581632653061225) internal successors, (650), 413 states have internal predecessors, (650), 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:44:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 827 transitions. [2025-01-09 03:44:27,752 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 827 transitions. Word has length 65 [2025-01-09 03:44:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:27,752 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 827 transitions. [2025-01-09 03:44:27,752 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:44:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 827 transitions. [2025-01-09 03:44:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 03:44:27,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:27,753 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:44:27,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:44:27,753 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:27,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:27,753 INFO L85 PathProgramCache]: Analyzing trace with hash -903837518, now seen corresponding path program 1 times [2025-01-09 03:44:27,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:27,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159862256] [2025-01-09 03:44:27,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:27,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:27,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 03:44:27,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 03:44:27,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:27,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:44:27,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:27,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159862256] [2025-01-09 03:44:27,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159862256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:27,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:27,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356012622] [2025-01-09 03:44:27,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:27,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:27,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:27,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:27,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:27,862 INFO L87 Difference]: Start difference. First operand 505 states and 827 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:44:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:27,917 INFO L93 Difference]: Finished difference Result 979 states and 1620 transitions. [2025-01-09 03:44:27,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:27,918 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:44:27,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:27,921 INFO L225 Difference]: With dead ends: 979 [2025-01-09 03:44:27,921 INFO L226 Difference]: Without dead ends: 505 [2025-01-09 03:44:27,923 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:44:27,923 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 17 mSDsluCounter, 3231 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4041 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:44:27,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4041 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:27,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-01-09 03:44:27,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-01-09 03:44:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 392 states have (on average 1.655612244897959) internal successors, (649), 413 states have internal predecessors, (649), 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:44:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 826 transitions. [2025-01-09 03:44:27,935 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 826 transitions. Word has length 66 [2025-01-09 03:44:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:27,936 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 826 transitions. [2025-01-09 03:44:27,936 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:44:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 826 transitions. [2025-01-09 03:44:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 03:44:27,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:27,937 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:44:27,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:44:27,937 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:27,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:27,937 INFO L85 PathProgramCache]: Analyzing trace with hash 202805022, now seen corresponding path program 1 times [2025-01-09 03:44:27,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:27,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142690151] [2025-01-09 03:44:27,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:27,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:27,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 03:44:27,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 03:44:27,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:27,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:28,008 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:44:28,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:28,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142690151] [2025-01-09 03:44:28,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142690151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:28,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:28,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:28,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540195425] [2025-01-09 03:44:28,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:28,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:28,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:28,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:28,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:28,010 INFO L87 Difference]: Start difference. First operand 505 states and 826 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:44:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:28,063 INFO L93 Difference]: Finished difference Result 979 states and 1619 transitions. [2025-01-09 03:44:28,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:28,064 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:44:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:28,067 INFO L225 Difference]: With dead ends: 979 [2025-01-09 03:44:28,067 INFO L226 Difference]: Without dead ends: 505 [2025-01-09 03:44:28,068 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:44:28,069 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 16 mSDsluCounter, 3231 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4041 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:44:28,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4041 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:28,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-01-09 03:44:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-01-09 03:44:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 392 states have (on average 1.653061224489796) internal successors, (648), 413 states have internal predecessors, (648), 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:44:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 825 transitions. [2025-01-09 03:44:28,080 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 825 transitions. Word has length 67 [2025-01-09 03:44:28,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:28,080 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 825 transitions. [2025-01-09 03:44:28,080 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:44:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 825 transitions. [2025-01-09 03:44:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:44:28,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:28,081 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:44:28,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:44:28,081 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:28,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1306288501, now seen corresponding path program 1 times [2025-01-09 03:44:28,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:28,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127400239] [2025-01-09 03:44:28,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:28,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:28,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:44:28,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:44:28,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:28,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:28,131 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:44:28,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:28,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127400239] [2025-01-09 03:44:28,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127400239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:28,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:28,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:28,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093479047] [2025-01-09 03:44:28,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:28,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:28,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:28,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:28,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:28,133 INFO L87 Difference]: Start difference. First operand 505 states and 825 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:44:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:28,157 INFO L93 Difference]: Finished difference Result 979 states and 1618 transitions. [2025-01-09 03:44:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:28,158 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:44:28,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:28,161 INFO L225 Difference]: With dead ends: 979 [2025-01-09 03:44:28,161 INFO L226 Difference]: Without dead ends: 505 [2025-01-09 03:44:28,163 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:44:28,163 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 9 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2448 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:44:28,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2448 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:28,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-01-09 03:44:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-01-09 03:44:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 392 states have (on average 1.6505102040816326) internal successors, (647), 413 states have internal predecessors, (647), 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:44:28,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 824 transitions. [2025-01-09 03:44:28,176 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 824 transitions. Word has length 68 [2025-01-09 03:44:28,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:28,176 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 824 transitions. [2025-01-09 03:44:28,176 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:44:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 824 transitions. [2025-01-09 03:44:28,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:44:28,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:28,177 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:44:28,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:44:28,178 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:28,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:28,178 INFO L85 PathProgramCache]: Analyzing trace with hash -276929203, now seen corresponding path program 1 times [2025-01-09 03:44:28,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:28,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516967112] [2025-01-09 03:44:28,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:28,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:28,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:44:28,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:44:28,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:28,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:28,234 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:44:28,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:28,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516967112] [2025-01-09 03:44:28,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516967112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:28,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:28,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:44:28,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372474617] [2025-01-09 03:44:28,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:28,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:44:28,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:28,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:44:28,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:44:28,235 INFO L87 Difference]: Start difference. First operand 505 states and 824 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:44:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:28,265 INFO L93 Difference]: Finished difference Result 973 states and 1606 transitions. [2025-01-09 03:44:28,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:44:28,265 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:44:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:28,268 INFO L225 Difference]: With dead ends: 973 [2025-01-09 03:44:28,269 INFO L226 Difference]: Without dead ends: 505 [2025-01-09 03:44:28,270 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:44:28,271 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 4 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2427 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:44:28,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2427 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:28,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-01-09 03:44:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-01-09 03:44:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 392 states have (on average 1.6479591836734695) internal successors, (646), 413 states have internal predecessors, (646), 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:44:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 823 transitions. [2025-01-09 03:44:28,283 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 823 transitions. Word has length 68 [2025-01-09 03:44:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:28,283 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 823 transitions. [2025-01-09 03:44:28,283 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:44:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 823 transitions. [2025-01-09 03:44:28,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 03:44:28,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:28,284 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:44:28,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:44:28,284 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:28,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:28,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1185873225, now seen corresponding path program 1 times [2025-01-09 03:44:28,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:28,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819630939] [2025-01-09 03:44:28,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:28,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:28,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 03:44:28,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 03:44:28,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:28,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:28,488 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:44:28,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:28,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819630939] [2025-01-09 03:44:28,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819630939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:28,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:28,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:44:28,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015620363] [2025-01-09 03:44:28,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:28,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:44:28,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:28,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:44:28,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:44:28,489 INFO L87 Difference]: Start difference. First operand 505 states and 823 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:44:30,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:30,286 INFO L93 Difference]: Finished difference Result 1568 states and 2622 transitions. [2025-01-09 03:44:30,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:44:30,286 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:44:30,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:30,295 INFO L225 Difference]: With dead ends: 1568 [2025-01-09 03:44:30,295 INFO L226 Difference]: Without dead ends: 1108 [2025-01-09 03:44:30,298 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:44:30,299 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 3115 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3175 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 2415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:30,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3175 Valid, 1016 Invalid, 2415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 03:44:30,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-01-09 03:44:30,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 986. [2025-01-09 03:44:30,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 774 states have (on average 1.67312661498708) internal successors, (1295), 804 states have internal predecessors, (1295), 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:44:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1645 transitions. [2025-01-09 03:44:30,350 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1645 transitions. Word has length 69 [2025-01-09 03:44:30,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:30,350 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1645 transitions. [2025-01-09 03:44:30,350 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:44:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1645 transitions. [2025-01-09 03:44:30,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:44:30,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:30,354 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:44:30,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:44:30,355 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:30,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:30,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1771582409, now seen corresponding path program 1 times [2025-01-09 03:44:30,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:30,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372917444] [2025-01-09 03:44:30,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:30,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:30,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:44:30,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:44:30,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:30,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:30,634 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:44:30,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:30,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372917444] [2025-01-09 03:44:30,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372917444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:30,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:30,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:44:30,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629016126] [2025-01-09 03:44:30,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:30,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:44:30,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:30,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:44:30,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:44:30,637 INFO L87 Difference]: Start difference. First operand 986 states and 1645 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:44:31,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:31,944 INFO L93 Difference]: Finished difference Result 1935 states and 3293 transitions. [2025-01-09 03:44:31,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:44:31,945 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:44:31,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:31,951 INFO L225 Difference]: With dead ends: 1935 [2025-01-09 03:44:31,951 INFO L226 Difference]: Without dead ends: 994 [2025-01-09 03:44:31,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:44:31,957 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1254 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 2511 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 2883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 2511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:31,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 1622 Invalid, 2883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 2511 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 03:44:31,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-01-09 03:44:31,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2025-01-09 03:44:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 780 states have (on average 1.667948717948718) internal successors, (1301), 810 states have internal predecessors, (1301), 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:44:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1683 transitions. [2025-01-09 03:44:32,006 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1683 transitions. Word has length 98 [2025-01-09 03:44:32,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:32,007 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1683 transitions. [2025-01-09 03:44:32,007 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:44:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1683 transitions. [2025-01-09 03:44:32,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:44:32,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:32,009 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:44:32,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:44:32,009 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:32,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:32,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1138816396, now seen corresponding path program 1 times [2025-01-09 03:44:32,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:32,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665212607] [2025-01-09 03:44:32,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:32,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:32,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:44:32,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:44:32,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:32,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:32,311 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:44:32,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:32,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665212607] [2025-01-09 03:44:32,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665212607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:32,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:32,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 03:44:32,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380587576] [2025-01-09 03:44:32,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:32,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 03:44:32,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:32,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 03:44:32,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:44:32,313 INFO L87 Difference]: Start difference. First operand 994 states and 1683 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:44:37,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:37,195 INFO L93 Difference]: Finished difference Result 3610 states and 6164 transitions. [2025-01-09 03:44:37,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 03:44:37,196 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:44:37,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:37,209 INFO L225 Difference]: With dead ends: 3610 [2025-01-09 03:44:37,209 INFO L226 Difference]: Without dead ends: 2661 [2025-01-09 03:44:37,214 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:44:37,214 INFO L435 NwaCegarLoop]: 758 mSDtfsCounter, 2116 mSDsluCounter, 6670 mSDsCounter, 0 mSdLazyCounter, 11891 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 7428 SdHoareTripleChecker+Invalid, 12475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 11891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:37,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 7428 Invalid, 12475 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [584 Valid, 11891 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 03:44:37,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2025-01-09 03:44:37,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2563. [2025-01-09 03:44:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2563 states, 1949 states have (on average 1.638276038994356) internal successors, (3193), 2025 states have internal predecessors, (3193), 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:44:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 4318 transitions. [2025-01-09 03:44:37,391 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 4318 transitions. Word has length 98 [2025-01-09 03:44:37,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:37,391 INFO L471 AbstractCegarLoop]: Abstraction has 2563 states and 4318 transitions. [2025-01-09 03:44:37,392 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:44:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 4318 transitions. [2025-01-09 03:44:37,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 03:44:37,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:37,394 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:44:37,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:44:37,395 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:37,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash -656397170, now seen corresponding path program 1 times [2025-01-09 03:44:37,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:37,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388148149] [2025-01-09 03:44:37,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:37,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:37,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:44:37,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:44:37,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:37,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:37,554 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:44:37,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:37,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388148149] [2025-01-09 03:44:37,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388148149] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:37,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:37,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:37,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264744818] [2025-01-09 03:44:37,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:37,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:37,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:37,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:37,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:37,556 INFO L87 Difference]: Start difference. First operand 2563 states and 4318 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:44:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:40,061 INFO L93 Difference]: Finished difference Result 8191 states and 14081 transitions. [2025-01-09 03:44:40,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 03:44:40,062 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:44:40,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:40,132 INFO L225 Difference]: With dead ends: 8191 [2025-01-09 03:44:40,135 INFO L226 Difference]: Without dead ends: 5673 [2025-01-09 03:44:40,172 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:44:40,172 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 2620 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 4146 mSolverCounterSat, 690 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2689 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 4836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 690 IncrementalHoareTripleChecker+Valid, 4146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:40,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2689 Valid, 2553 Invalid, 4836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [690 Valid, 4146 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 03:44:40,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2025-01-09 03:44:40,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 5442. [2025-01-09 03:44:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5442 states, 4131 states have (on average 1.6274509803921569) internal successors, (6723), 4312 states have internal predecessors, (6723), 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:44:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5442 states to 5442 states and 9048 transitions. [2025-01-09 03:44:40,737 INFO L78 Accepts]: Start accepts. Automaton has 5442 states and 9048 transitions. Word has length 99 [2025-01-09 03:44:40,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:40,739 INFO L471 AbstractCegarLoop]: Abstraction has 5442 states and 9048 transitions. [2025-01-09 03:44:40,744 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:44:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand 5442 states and 9048 transitions. [2025-01-09 03:44:40,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:44:40,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:40,746 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:44:40,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:44:40,746 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:40,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:40,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1765906079, now seen corresponding path program 1 times [2025-01-09 03:44:40,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:40,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927409829] [2025-01-09 03:44:40,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:40,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:40,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:44:40,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:44:40,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:40,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:40,932 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:44:40,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:40,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927409829] [2025-01-09 03:44:40,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927409829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:40,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:40,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:40,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327734428] [2025-01-09 03:44:40,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:40,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:40,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:40,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:40,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:40,934 INFO L87 Difference]: Start difference. First operand 5442 states and 9048 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), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 03:44:44,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:44,225 INFO L93 Difference]: Finished difference Result 18887 states and 31972 transitions. [2025-01-09 03:44:44,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:44:44,226 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), 2 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:44:44,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:44,302 INFO L225 Difference]: With dead ends: 18887 [2025-01-09 03:44:44,302 INFO L226 Difference]: Without dead ends: 13484 [2025-01-09 03:44:44,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:44:44,328 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 2796 mSDsluCounter, 1754 mSDsCounter, 0 mSdLazyCounter, 5137 mSolverCounterSat, 665 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2903 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 5802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 5137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:44,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2903 Valid, 2397 Invalid, 5802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [665 Valid, 5137 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 03:44:44,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13484 states. [2025-01-09 03:44:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13484 to 11440. [2025-01-09 03:44:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11440 states, 8376 states have (on average 1.6170009551098377) internal successors, (13544), 8858 states have internal predecessors, (13544), 2618 states have call successors, (2618), 362 states have call predecessors, (2618), 445 states have return successors, (3185), 2529 states have call predecessors, (3185), 2613 states have call successors, (3185) [2025-01-09 03:44:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 19347 transitions. [2025-01-09 03:44:45,045 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 19347 transitions. Word has length 101 [2025-01-09 03:44:45,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:45,047 INFO L471 AbstractCegarLoop]: Abstraction has 11440 states and 19347 transitions. [2025-01-09 03:44:45,048 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), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 03:44:45,048 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 19347 transitions. [2025-01-09 03:44:45,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:44:45,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:45,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:44:45,051 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:45,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:45,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1157253919, now seen corresponding path program 1 times [2025-01-09 03:44:45,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:45,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949274558] [2025-01-09 03:44:45,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:45,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:45,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:44:45,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:44:45,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:45,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:45,291 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:44:45,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:45,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949274558] [2025-01-09 03:44:45,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949274558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:45,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:45,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:45,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759040823] [2025-01-09 03:44:45,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:45,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:45,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:45,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:45,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:45,294 INFO L87 Difference]: Start difference. First operand 11440 states and 19347 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:44:48,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:48,327 INFO L93 Difference]: Finished difference Result 34307 states and 58930 transitions. [2025-01-09 03:44:48,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 03:44:48,328 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:44:48,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:48,471 INFO L225 Difference]: With dead ends: 34307 [2025-01-09 03:44:48,471 INFO L226 Difference]: Without dead ends: 24393 [2025-01-09 03:44:48,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:44:48,528 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 2310 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 3487 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2390 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 3989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 3487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:48,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2390 Valid, 1752 Invalid, 3989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 3487 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 03:44:48,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24393 states. [2025-01-09 03:44:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24393 to 23320. [2025-01-09 03:44:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23320 states, 17108 states have (on average 1.6171381809679681) internal successors, (27666), 18133 states have internal predecessors, (27666), 5189 states have call successors, (5189), 716 states have call predecessors, (5189), 1022 states have return successors, (6877), 5045 states have call predecessors, (6877), 5184 states have call successors, (6877) [2025-01-09 03:44:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23320 states to 23320 states and 39732 transitions. [2025-01-09 03:44:50,197 INFO L78 Accepts]: Start accepts. Automaton has 23320 states and 39732 transitions. Word has length 101 [2025-01-09 03:44:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:50,198 INFO L471 AbstractCegarLoop]: Abstraction has 23320 states and 39732 transitions. [2025-01-09 03:44:50,199 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:44:50,199 INFO L276 IsEmpty]: Start isEmpty. Operand 23320 states and 39732 transitions. [2025-01-09 03:44:50,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:44:50,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:50,201 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:44:50,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:44:50,201 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:50,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:50,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1612777528, now seen corresponding path program 1 times [2025-01-09 03:44:50,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:50,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548937538] [2025-01-09 03:44:50,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:50,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:50,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:44:50,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:44:50,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:50,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:50,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:44:50,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:50,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548937538] [2025-01-09 03:44:50,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548937538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:50,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:50,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:44:50,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220199636] [2025-01-09 03:44:50,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:50,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:44:50,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:50,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:44:50,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:44:50,291 INFO L87 Difference]: Start difference. First operand 23320 states and 39732 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:44:51,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:51,349 INFO L93 Difference]: Finished difference Result 45210 states and 77388 transitions. [2025-01-09 03:44:51,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:44:51,349 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:44:51,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:51,481 INFO L225 Difference]: With dead ends: 45210 [2025-01-09 03:44:51,481 INFO L226 Difference]: Without dead ends: 23636 [2025-01-09 03:44:51,560 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:44:51,563 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 0 mSDsluCounter, 2433 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3254 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:44:51,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3254 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:44:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23636 states. [2025-01-09 03:44:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23636 to 23576. [2025-01-09 03:44:52,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23576 states, 17306 states have (on average 1.60938402866058) internal successors, (27852), 18325 states have internal predecessors, (27852), 5177 states have call successors, (5177), 716 states have call predecessors, (5177), 1092 states have return successors, (7098), 5109 states have call predecessors, (7098), 5172 states have call successors, (7098) [2025-01-09 03:44:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23576 states to 23576 states and 40127 transitions. [2025-01-09 03:44:52,985 INFO L78 Accepts]: Start accepts. Automaton has 23576 states and 40127 transitions. Word has length 106 [2025-01-09 03:44:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:52,986 INFO L471 AbstractCegarLoop]: Abstraction has 23576 states and 40127 transitions. [2025-01-09 03:44:52,986 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:44:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 23576 states and 40127 transitions. [2025-01-09 03:44:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:44:52,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:52,989 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:44:52,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:44:52,989 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:52,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:52,990 INFO L85 PathProgramCache]: Analyzing trace with hash 419287835, now seen corresponding path program 1 times [2025-01-09 03:44:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:52,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135376662] [2025-01-09 03:44:52,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:53,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:44:53,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:44:53,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:53,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:53,183 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:44:53,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:53,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135376662] [2025-01-09 03:44:53,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135376662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:53,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:53,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:44:53,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269284522] [2025-01-09 03:44:53,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:53,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:44:53,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:53,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:44:53,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:44:53,185 INFO L87 Difference]: Start difference. First operand 23576 states and 40127 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:44:54,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:54,781 INFO L93 Difference]: Finished difference Result 49398 states and 86034 transitions. [2025-01-09 03:44:54,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:44:54,781 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:44:54,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:44:54,893 INFO L225 Difference]: With dead ends: 49398 [2025-01-09 03:44:54,894 INFO L226 Difference]: Without dead ends: 24132 [2025-01-09 03:44:54,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:44:54,969 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 235 mSDsluCounter, 5767 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 6633 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:44:54,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 6633 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:44:54,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24132 states. [2025-01-09 03:44:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24132 to 23648. [2025-01-09 03:44:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23648 states, 17369 states have (on average 1.5803442915539179) internal successors, (27449), 18397 states have internal predecessors, (27449), 5177 states have call successors, (5177), 716 states have call predecessors, (5177), 1101 states have return successors, (7134), 5109 states have call predecessors, (7134), 5172 states have call successors, (7134) [2025-01-09 03:44:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23648 states to 23648 states and 39760 transitions. [2025-01-09 03:44:56,125 INFO L78 Accepts]: Start accepts. Automaton has 23648 states and 39760 transitions. Word has length 113 [2025-01-09 03:44:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:44:56,125 INFO L471 AbstractCegarLoop]: Abstraction has 23648 states and 39760 transitions. [2025-01-09 03:44:56,125 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:44:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 23648 states and 39760 transitions. [2025-01-09 03:44:56,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:44:56,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:44:56,129 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:44:56,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:44:56,129 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:44:56,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:44:56,129 INFO L85 PathProgramCache]: Analyzing trace with hash 819891117, now seen corresponding path program 1 times [2025-01-09 03:44:56,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:44:56,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074097914] [2025-01-09 03:44:56,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:44:56,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:44:56,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:44:56,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:44:56,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:44:56,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:44:56,482 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:44:56,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:44:56,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074097914] [2025-01-09 03:44:56,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074097914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:44:56,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:44:56,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:44:56,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537506901] [2025-01-09 03:44:56,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:44:56,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:44:56,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:44:56,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:44:56,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:44:56,483 INFO L87 Difference]: Start difference. First operand 23648 states and 39760 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:44:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:44:59,880 INFO L93 Difference]: Finished difference Result 48180 states and 81379 transitions. [2025-01-09 03:44:59,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:44:59,881 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:44:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:00,108 INFO L225 Difference]: With dead ends: 48180 [2025-01-09 03:45:00,108 INFO L226 Difference]: Without dead ends: 26299 [2025-01-09 03:45:00,238 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:00,239 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 2034 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 3001 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2110 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 3478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 3001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:00,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2110 Valid, 1696 Invalid, 3478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 3001 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 03:45:00,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26299 states. [2025-01-09 03:45:01,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26299 to 24746. [2025-01-09 03:45:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24746 states, 18188 states have (on average 1.5677369694303938) internal successors, (28514), 19288 states have internal predecessors, (28514), 5282 states have call successors, (5282), 821 states have call predecessors, (5282), 1275 states have return successors, (7535), 5211 states have call predecessors, (7535), 5277 states have call successors, (7535) [2025-01-09 03:45:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24746 states to 24746 states and 41331 transitions. [2025-01-09 03:45:01,819 INFO L78 Accepts]: Start accepts. Automaton has 24746 states and 41331 transitions. Word has length 118 [2025-01-09 03:45:01,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:01,820 INFO L471 AbstractCegarLoop]: Abstraction has 24746 states and 41331 transitions. [2025-01-09 03:45:01,821 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:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 24746 states and 41331 transitions. [2025-01-09 03:45:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:45:01,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:01,828 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:01,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 03:45:01,828 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:01,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:01,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2087622112, now seen corresponding path program 1 times [2025-01-09 03:45:01,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:01,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614413561] [2025-01-09 03:45:01,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:01,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:01,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:45:01,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:45:01,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:01,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:01,960 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:01,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614413561] [2025-01-09 03:45:01,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614413561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:01,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:01,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:45:01,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344361941] [2025-01-09 03:45:01,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:01,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:45:01,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:01,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:45:01,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:01,961 INFO L87 Difference]: Start difference. First operand 24746 states and 41331 transitions. Second operand has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:45:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:03,654 INFO L93 Difference]: Finished difference Result 59404 states and 100083 transitions. [2025-01-09 03:45:03,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:03,654 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 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:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:03,839 INFO L225 Difference]: With dead ends: 59404 [2025-01-09 03:45:03,839 INFO L226 Difference]: Without dead ends: 36425 [2025-01-09 03:45:03,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:45:03,912 INFO L435 NwaCegarLoop]: 1324 mSDtfsCounter, 773 mSDsluCounter, 7362 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 8686 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:03,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 8686 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:45:03,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36425 states. [2025-01-09 03:45:05,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36425 to 33782. [2025-01-09 03:45:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33782 states, 24788 states have (on average 1.575359044699048) internal successors, (39050), 26230 states have internal predecessors, (39050), 7374 states have call successors, (7374), 1047 states have call predecessors, (7374), 1619 states have return successors, (10406), 7344 states have call predecessors, (10406), 7369 states have call successors, (10406) [2025-01-09 03:45:05,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33782 states to 33782 states and 56830 transitions. [2025-01-09 03:45:05,565 INFO L78 Accepts]: Start accepts. Automaton has 33782 states and 56830 transitions. Word has length 123 [2025-01-09 03:45:05,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:05,566 INFO L471 AbstractCegarLoop]: Abstraction has 33782 states and 56830 transitions. [2025-01-09 03:45:05,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:45:05,566 INFO L276 IsEmpty]: Start isEmpty. Operand 33782 states and 56830 transitions. [2025-01-09 03:45:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:45:05,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:05,570 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:05,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 03:45:05,570 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:05,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:05,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2073331678, now seen corresponding path program 1 times [2025-01-09 03:45:05,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:05,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335129109] [2025-01-09 03:45:05,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:05,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:05,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:45:05,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:45:05,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:05,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:05,731 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:05,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:05,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335129109] [2025-01-09 03:45:05,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335129109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:05,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:05,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:05,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170677093] [2025-01-09 03:45:05,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:05,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:05,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:05,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:05,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:05,733 INFO L87 Difference]: Start difference. First operand 33782 states and 56830 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:08,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:08,299 INFO L93 Difference]: Finished difference Result 33952 states and 57140 transitions. [2025-01-09 03:45:08,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:45:08,300 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:08,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:08,592 INFO L225 Difference]: With dead ends: 33952 [2025-01-09 03:45:08,593 INFO L226 Difference]: Without dead ends: 33937 [2025-01-09 03:45:08,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:08,638 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 883 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 2871 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.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:08,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 2871 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:45:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33937 states. [2025-01-09 03:45:10,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33937 to 33792. [2025-01-09 03:45:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33792 states, 24798 states have (on average 1.5751270263730945) internal successors, (39060), 26240 states have internal predecessors, (39060), 7374 states have call successors, (7374), 1047 states have call predecessors, (7374), 1619 states have return successors, (10406), 7344 states have call predecessors, (10406), 7369 states have call successors, (10406) [2025-01-09 03:45:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33792 states to 33792 states and 56840 transitions. [2025-01-09 03:45:10,864 INFO L78 Accepts]: Start accepts. Automaton has 33792 states and 56840 transitions. Word has length 123 [2025-01-09 03:45:10,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:10,866 INFO L471 AbstractCegarLoop]: Abstraction has 33792 states and 56840 transitions. [2025-01-09 03:45:10,866 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:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand 33792 states and 56840 transitions. [2025-01-09 03:45:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:45:10,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:10,870 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:10,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 03:45:10,870 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:10,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1042484665, now seen corresponding path program 1 times [2025-01-09 03:45:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:10,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33119024] [2025-01-09 03:45:10,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:10,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:10,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:45:10,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:45:10,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:10,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:11,072 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:11,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:11,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33119024] [2025-01-09 03:45:11,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33119024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:11,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:11,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 03:45:11,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784271853] [2025-01-09 03:45:11,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:11,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:45:11,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:11,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:45:11,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:45:11,075 INFO L87 Difference]: Start difference. First operand 33792 states and 56840 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:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:12,803 INFO L93 Difference]: Finished difference Result 34642 states and 58226 transitions. [2025-01-09 03:45:12,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:45:12,804 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:12,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:13,000 INFO L225 Difference]: With dead ends: 34642 [2025-01-09 03:45:13,000 INFO L226 Difference]: Without dead ends: 34579 [2025-01-09 03:45:13,024 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:13,024 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 807 mSDsluCounter, 6355 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 7159 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:13,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 7159 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:45:13,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34579 states. [2025-01-09 03:45:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34579 to 34510. [2025-01-09 03:45:14,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34510 states, 25347 states have (on average 1.570244999408214) internal successors, (39801), 26789 states have internal predecessors, (39801), 7478 states have call successors, (7478), 1114 states have call predecessors, (7478), 1684 states have return successors, (10729), 7442 states have call predecessors, (10729), 7473 states have call successors, (10729) [2025-01-09 03:45:14,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34510 states to 34510 states and 58008 transitions. [2025-01-09 03:45:14,724 INFO L78 Accepts]: Start accepts. Automaton has 34510 states and 58008 transitions. Word has length 129 [2025-01-09 03:45:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:14,724 INFO L471 AbstractCegarLoop]: Abstraction has 34510 states and 58008 transitions. [2025-01-09 03:45:14,724 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:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand 34510 states and 58008 transitions. [2025-01-09 03:45:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 03:45:14,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:14,727 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:14,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 03:45:14,727 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:14,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:14,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1431013805, now seen corresponding path program 1 times [2025-01-09 03:45:14,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:14,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312481844] [2025-01-09 03:45:14,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:14,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:14,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 03:45:14,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 03:45:14,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:14,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:14,902 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:14,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:14,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312481844] [2025-01-09 03:45:14,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312481844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:14,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:14,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:45:14,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737439961] [2025-01-09 03:45:14,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:14,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:45:14,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:14,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:45:14,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:14,904 INFO L87 Difference]: Start difference. First operand 34510 states and 58008 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)