./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product29.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_product29.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 a9d4bfafe2ee2b10c7451875462462bdbc63aaee25e1868c3faa4756fb5ebfc5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:45:21,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:45:21,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:45:21,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:45:21,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:45:21,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:45:21,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:45:21,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:45:21,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:45:21,819 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:45:21,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:45:21,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:45:21,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:45:21,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:45:21,819 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:45:21,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:45:21,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:45:21,819 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:45:21,820 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:45:21,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:45:21,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:45:21,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:45:21,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:45:21,821 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:45:21,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:45:21,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:45:21,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:45:21,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:45:21,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:45:21,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:45:21,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:45:21,821 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 -> a9d4bfafe2ee2b10c7451875462462bdbc63aaee25e1868c3faa4756fb5ebfc5 [2025-01-09 03:45:22,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:45:22,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:45:22,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:45:22,160 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:45:22,160 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:45:22,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product29.cil.c [2025-01-09 03:45:23,542 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72cb7a7b0/9d47adbe10194ccca407bcb60d1aa585/FLAG5c4278771 [2025-01-09 03:45:23,914 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:45:23,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product29.cil.c [2025-01-09 03:45:23,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72cb7a7b0/9d47adbe10194ccca407bcb60d1aa585/FLAG5c4278771 [2025-01-09 03:45:23,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72cb7a7b0/9d47adbe10194ccca407bcb60d1aa585 [2025-01-09 03:45:23,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:45:23,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:45:23,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:45:23,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:45:23,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:45:23,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:45:23" (1/1) ... [2025-01-09 03:45:23,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2017b91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:23, skipping insertion in model container [2025-01-09 03:45:23,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:45:23" (1/1) ... [2025-01-09 03:45:23,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:45:24,129 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_product29.cil.c[17414,17427] [2025-01-09 03:45:24,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:45:24,296 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:45:24,302 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2025-01-09 03:45:24,303 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [716] [2025-01-09 03:45:24,303 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [725] [2025-01-09 03:45:24,303 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [739] [2025-01-09 03:45:24,304 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2285] [2025-01-09 03:45:24,304 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2651] [2025-01-09 03:45:24,304 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3008] [2025-01-09 03:45:24,304 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3126] [2025-01-09 03:45:24,304 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [3217] [2025-01-09 03:45:24,304 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3398] [2025-01-09 03:45:24,320 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_product29.cil.c[17414,17427] [2025-01-09 03:45:24,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:45:24,443 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:45:24,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:24 WrapperNode [2025-01-09 03:45:24,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:45:24,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:45:24,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:45:24,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:45:24,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:24" (1/1) ... [2025-01-09 03:45:24,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:24" (1/1) ... [2025-01-09 03:45:24,504 INFO L138 Inliner]: procedures = 93, calls = 341, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 901 [2025-01-09 03:45:24,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:45:24,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:45:24,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:45:24,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:45:24,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:24" (1/1) ... [2025-01-09 03:45:24,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:24" (1/1) ... [2025-01-09 03:45:24,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:24" (1/1) ... [2025-01-09 03:45:24,530 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-01-09 03:45:24,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:24" (1/1) ... [2025-01-09 03:45:24,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:24" (1/1) ... [2025-01-09 03:45:24,542 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:24" (1/1) ... [2025-01-09 03:45:24,544 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:24" (1/1) ... [2025-01-09 03:45:24,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:24" (1/1) ... [2025-01-09 03:45:24,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:24" (1/1) ... [2025-01-09 03:45:24,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:24" (1/1) ... [2025-01-09 03:45:24,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:45:24,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:45:24,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:45:24,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:45:24,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:24" (1/1) ... [2025-01-09 03:45:24,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:45:24,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:45:24,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:45:24,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:45:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:45:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:45:24,642 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:45:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-01-09 03:45:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-01-09 03:45:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:45:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:45:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:45:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:45:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:45:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:45:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-01-09 03:45:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-01-09 03:45:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:45:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:45:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:45:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:45:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-01-09 03:45:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-01-09 03:45:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:45:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:45:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:45:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:45:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:45:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:45:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:45:24,645 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-01-09 03:45:24,646 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:45:24,646 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:45:24,646 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:45:24,646 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:45:24,646 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:45:24,646 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:45:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:45:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:45:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:45:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:45:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:45:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:45:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:45:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:45:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:45:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-01-09 03:45:24,647 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-01-09 03:45:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:45:24,647 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:45:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:45:24,647 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:45:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:45:24,647 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:45:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:45:24,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:45:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:45:24,647 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:45:24,821 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:45:24,824 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:45:25,816 INFO L? ?]: Removed 460 outVars from TransFormulas that were not future-live. [2025-01-09 03:45:25,816 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:45:25,842 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:45:25,845 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:45:25,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:45:25 BoogieIcfgContainer [2025-01-09 03:45:25,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:45:25,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:45:25,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:45:25,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:45:25,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:45:23" (1/3) ... [2025-01-09 03:45:25,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5141c136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:45:25, skipping insertion in model container [2025-01-09 03:45:25,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:24" (2/3) ... [2025-01-09 03:45:25,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5141c136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:45:25, skipping insertion in model container [2025-01-09 03:45:25,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:45:25" (3/3) ... [2025-01-09 03:45:25,854 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product29.cil.c [2025-01-09 03:45:25,865 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:45:25,868 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product29.cil.c that has 25 procedures, 571 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:45:25,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:45:25,937 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;@1a674f9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:45:25,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:45:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 571 states, 450 states have (on average 1.6955555555555555) internal successors, (763), 471 states have internal predecessors, (763), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 03:45:25,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 03:45:25,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:25,974 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] [2025-01-09 03:45:25,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:25,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1654667507, now seen corresponding path program 1 times [2025-01-09 03:45:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:25,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432049036] [2025-01-09 03:45:25,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:25,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:26,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 03:45:26,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 03:45:26,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:26,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:26,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:26,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:26,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432049036] [2025-01-09 03:45:26,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432049036] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:26,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:26,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:26,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452628077] [2025-01-09 03:45:26,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:26,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:26,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:26,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:26,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:26,610 INFO L87 Difference]: Start difference. First operand has 571 states, 450 states have (on average 1.6955555555555555) internal successors, (763), 471 states have internal predecessors, (763), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:26,777 INFO L93 Difference]: Finished difference Result 1122 states and 1881 transitions. [2025-01-09 03:45:26,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:26,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2025-01-09 03:45:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:26,792 INFO L225 Difference]: With dead ends: 1122 [2025-01-09 03:45:26,793 INFO L226 Difference]: Without dead ends: 563 [2025-01-09 03:45:26,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:26,808 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 5 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:26,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2795 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:26,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-01-09 03:45:26,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-01-09 03:45:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 444 states have (on average 1.6936936936936937) internal successors, (752), 463 states have internal predecessors, (752), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 03:45:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 937 transitions. [2025-01-09 03:45:26,904 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 937 transitions. Word has length 88 [2025-01-09 03:45:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:26,905 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 937 transitions. [2025-01-09 03:45:26,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 937 transitions. [2025-01-09 03:45:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 03:45:26,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:26,914 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] [2025-01-09 03:45:26,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:45:26,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:26,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:26,915 INFO L85 PathProgramCache]: Analyzing trace with hash 111112287, now seen corresponding path program 1 times [2025-01-09 03:45:26,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:26,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375103231] [2025-01-09 03:45:26,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:26,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:26,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 03:45:26,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 03:45:26,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:26,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:27,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:27,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375103231] [2025-01-09 03:45:27,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375103231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:27,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:27,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:27,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809804782] [2025-01-09 03:45:27,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:27,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:27,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:27,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:27,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:27,162 INFO L87 Difference]: Start difference. First operand 563 states and 937 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:27,235 INFO L93 Difference]: Finished difference Result 1108 states and 1851 transitions. [2025-01-09 03:45:27,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:27,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 90 [2025-01-09 03:45:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:27,240 INFO L225 Difference]: With dead ends: 1108 [2025-01-09 03:45:27,240 INFO L226 Difference]: Without dead ends: 563 [2025-01-09 03:45:27,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:27,244 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 4 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:27,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2774 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:27,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-01-09 03:45:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-01-09 03:45:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 444 states have (on average 1.6914414414414414) internal successors, (751), 463 states have internal predecessors, (751), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 03:45:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 936 transitions. [2025-01-09 03:45:27,294 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 936 transitions. Word has length 90 [2025-01-09 03:45:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:27,294 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 936 transitions. [2025-01-09 03:45:27,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 936 transitions. [2025-01-09 03:45:27,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 03:45:27,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:27,298 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] [2025-01-09 03:45:27,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:45:27,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:27,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:27,299 INFO L85 PathProgramCache]: Analyzing trace with hash -204603012, now seen corresponding path program 1 times [2025-01-09 03:45:27,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:27,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059548817] [2025-01-09 03:45:27,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:27,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:27,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 03:45:27,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 03:45:27,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:27,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:27,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:27,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059548817] [2025-01-09 03:45:27,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059548817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:27,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:27,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:27,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410874421] [2025-01-09 03:45:27,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:27,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:27,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:27,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:27,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:27,552 INFO L87 Difference]: Start difference. First operand 563 states and 936 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:27,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:27,617 INFO L93 Difference]: Finished difference Result 1108 states and 1850 transitions. [2025-01-09 03:45:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:27,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 91 [2025-01-09 03:45:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:27,625 INFO L225 Difference]: With dead ends: 1108 [2025-01-09 03:45:27,625 INFO L226 Difference]: Without dead ends: 563 [2025-01-09 03:45:27,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:27,628 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 3 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:27,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2774 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:27,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-01-09 03:45:27,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-01-09 03:45:27,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 444 states have (on average 1.6891891891891893) internal successors, (750), 463 states have internal predecessors, (750), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 03:45:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 935 transitions. [2025-01-09 03:45:27,654 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 935 transitions. Word has length 91 [2025-01-09 03:45:27,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:27,655 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 935 transitions. [2025-01-09 03:45:27,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 935 transitions. [2025-01-09 03:45:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 03:45:27,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:27,659 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] [2025-01-09 03:45:27,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:45:27,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:27,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:27,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1347711485, now seen corresponding path program 1 times [2025-01-09 03:45:27,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:27,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446135018] [2025-01-09 03:45:27,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:27,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:27,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:45:27,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:45:27,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:27,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:27,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:27,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:27,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446135018] [2025-01-09 03:45:27,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446135018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:27,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:27,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:27,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782797981] [2025-01-09 03:45:27,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:27,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:27,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:27,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:27,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:27,823 INFO L87 Difference]: Start difference. First operand 563 states and 935 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:27,868 INFO L93 Difference]: Finished difference Result 1108 states and 1849 transitions. [2025-01-09 03:45:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:27,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2025-01-09 03:45:27,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:27,874 INFO L225 Difference]: With dead ends: 1108 [2025-01-09 03:45:27,874 INFO L226 Difference]: Without dead ends: 563 [2025-01-09 03:45:27,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:27,880 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 2 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:27,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2774 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:27,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-01-09 03:45:27,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-01-09 03:45:27,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 444 states have (on average 1.686936936936937) internal successors, (749), 463 states have internal predecessors, (749), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 03:45:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 934 transitions. [2025-01-09 03:45:27,909 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 934 transitions. Word has length 92 [2025-01-09 03:45:27,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:27,910 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 934 transitions. [2025-01-09 03:45:27,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 934 transitions. [2025-01-09 03:45:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 03:45:27,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:27,916 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] [2025-01-09 03:45:27,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:45:27,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:27,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1924762720, now seen corresponding path program 1 times [2025-01-09 03:45:27,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:27,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275418524] [2025-01-09 03:45:27,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:27,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:27,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 03:45:27,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 03:45:27,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:27,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:28,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:28,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275418524] [2025-01-09 03:45:28,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275418524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:28,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:28,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:28,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847759134] [2025-01-09 03:45:28,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:28,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:28,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:28,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:28,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:28,061 INFO L87 Difference]: Start difference. First operand 563 states and 934 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:28,103 INFO L93 Difference]: Finished difference Result 1108 states and 1848 transitions. [2025-01-09 03:45:28,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:28,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2025-01-09 03:45:28,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:28,107 INFO L225 Difference]: With dead ends: 1108 [2025-01-09 03:45:28,107 INFO L226 Difference]: Without dead ends: 563 [2025-01-09 03:45:28,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:28,109 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 1 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:28,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2774 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-01-09 03:45:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-01-09 03:45:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 444 states have (on average 1.6846846846846846) internal successors, (748), 463 states have internal predecessors, (748), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 03:45:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 933 transitions. [2025-01-09 03:45:28,127 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 933 transitions. Word has length 93 [2025-01-09 03:45:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:28,128 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 933 transitions. [2025-01-09 03:45:28,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:28,128 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 933 transitions. [2025-01-09 03:45:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 03:45:28,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:28,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:28,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:45:28,131 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:28,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:28,131 INFO L85 PathProgramCache]: Analyzing trace with hash 346379175, now seen corresponding path program 1 times [2025-01-09 03:45:28,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:28,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986887714] [2025-01-09 03:45:28,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:28,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:28,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 03:45:28,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 03:45:28,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:28,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:28,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:28,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986887714] [2025-01-09 03:45:28,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986887714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:28,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:28,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:28,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251479539] [2025-01-09 03:45:28,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:28,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:28,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:28,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:28,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:28,321 INFO L87 Difference]: Start difference. First operand 563 states and 933 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:45:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:28,407 INFO L93 Difference]: Finished difference Result 1074 states and 1780 transitions. [2025-01-09 03:45:28,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:28,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2025-01-09 03:45:28,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:28,412 INFO L225 Difference]: With dead ends: 1074 [2025-01-09 03:45:28,412 INFO L226 Difference]: Without dead ends: 578 [2025-01-09 03:45:28,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:28,415 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 91 mSDsluCounter, 4534 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5457 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:28,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5457 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:28,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-01-09 03:45:28,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 576. [2025-01-09 03:45:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 454 states have (on average 1.6806167400881058) internal successors, (763), 475 states have internal predecessors, (763), 96 states have call successors, (96), 24 states have call predecessors, (96), 25 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2025-01-09 03:45:28,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 952 transitions. [2025-01-09 03:45:28,441 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 952 transitions. Word has length 94 [2025-01-09 03:45:28,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:28,442 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 952 transitions. [2025-01-09 03:45:28,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:45:28,442 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 952 transitions. [2025-01-09 03:45:28,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 03:45:28,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:28,446 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] [2025-01-09 03:45:28,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:45:28,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:28,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:28,447 INFO L85 PathProgramCache]: Analyzing trace with hash 359911976, now seen corresponding path program 1 times [2025-01-09 03:45:28,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:28,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035014063] [2025-01-09 03:45:28,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:28,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:28,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 03:45:28,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 03:45:28,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:28,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:28,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:28,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035014063] [2025-01-09 03:45:28,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035014063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:28,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:28,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:28,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684324894] [2025-01-09 03:45:28,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:28,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:28,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:28,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:28,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:28,557 INFO L87 Difference]: Start difference. First operand 576 states and 952 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:28,597 INFO L93 Difference]: Finished difference Result 1126 states and 1874 transitions. [2025-01-09 03:45:28,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:28,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2025-01-09 03:45:28,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:28,602 INFO L225 Difference]: With dead ends: 1126 [2025-01-09 03:45:28,602 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 03:45:28,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:28,604 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 0 mSDsluCounter, 1849 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:28,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2776 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 03:45:28,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-01-09 03:45:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 438 states have (on average 1.6757990867579908) internal successors, (734), 457 states have internal predecessors, (734), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 03:45:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 919 transitions. [2025-01-09 03:45:28,621 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 919 transitions. Word has length 94 [2025-01-09 03:45:28,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:28,622 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 919 transitions. [2025-01-09 03:45:28,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:28,622 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 919 transitions. [2025-01-09 03:45:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 03:45:28,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:28,624 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] [2025-01-09 03:45:28,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:45:28,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:28,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:28,625 INFO L85 PathProgramCache]: Analyzing trace with hash -638105977, now seen corresponding path program 1 times [2025-01-09 03:45:28,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:28,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374976488] [2025-01-09 03:45:28,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:28,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:28,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 03:45:28,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 03:45:28,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:28,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:28,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:28,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374976488] [2025-01-09 03:45:28,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374976488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:28,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:28,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:28,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821003158] [2025-01-09 03:45:28,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:28,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:28,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:28,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:28,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:28,740 INFO L87 Difference]: Start difference. First operand 557 states and 919 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:28,887 INFO L93 Difference]: Finished difference Result 1071 states and 1772 transitions. [2025-01-09 03:45:28,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:28,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 95 [2025-01-09 03:45:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:28,892 INFO L225 Difference]: With dead ends: 1071 [2025-01-09 03:45:28,892 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 03:45:28,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:28,894 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 55 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4351 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:28,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4351 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:45:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 03:45:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 557. [2025-01-09 03:45:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 438 states have (on average 1.6666666666666667) internal successors, (730), 457 states have internal predecessors, (730), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 03:45:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 915 transitions. [2025-01-09 03:45:28,910 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 915 transitions. Word has length 95 [2025-01-09 03:45:28,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:28,911 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 915 transitions. [2025-01-09 03:45:28,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:28,911 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 915 transitions. [2025-01-09 03:45:28,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 03:45:28,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:28,913 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] [2025-01-09 03:45:28,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:45:28,914 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:28,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:28,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1923511004, now seen corresponding path program 1 times [2025-01-09 03:45:28,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:28,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229043247] [2025-01-09 03:45:28,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:28,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:28,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 03:45:28,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 03:45:28,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:28,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:29,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:29,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229043247] [2025-01-09 03:45:29,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229043247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:29,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:29,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:29,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78728155] [2025-01-09 03:45:29,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:29,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:29,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:29,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:29,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:29,137 INFO L87 Difference]: Start difference. First operand 557 states and 915 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:29,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:29,372 INFO L93 Difference]: Finished difference Result 1071 states and 1768 transitions. [2025-01-09 03:45:29,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:29,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2025-01-09 03:45:29,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:29,384 INFO L225 Difference]: With dead ends: 1071 [2025-01-09 03:45:29,384 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 03:45:29,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:29,387 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 54 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4351 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:29,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4351 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:45:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 03:45:29,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 557. [2025-01-09 03:45:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 438 states have (on average 1.6575342465753424) internal successors, (726), 457 states have internal predecessors, (726), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 03:45:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 911 transitions. [2025-01-09 03:45:29,424 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 911 transitions. Word has length 96 [2025-01-09 03:45:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:29,425 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 911 transitions. [2025-01-09 03:45:29,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 911 transitions. [2025-01-09 03:45:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 03:45:29,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:29,432 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] [2025-01-09 03:45:29,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:45:29,432 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:29,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:29,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1654783298, now seen corresponding path program 1 times [2025-01-09 03:45:29,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:29,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797414456] [2025-01-09 03:45:29,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:29,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:29,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 03:45:29,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 03:45:29,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:29,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:29,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:29,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797414456] [2025-01-09 03:45:29,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797414456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:29,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:29,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:29,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021713140] [2025-01-09 03:45:29,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:29,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:29,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:29,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:29,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:29,593 INFO L87 Difference]: Start difference. First operand 557 states and 911 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:29,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:29,726 INFO L93 Difference]: Finished difference Result 1071 states and 1764 transitions. [2025-01-09 03:45:29,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:29,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2025-01-09 03:45:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:29,731 INFO L225 Difference]: With dead ends: 1071 [2025-01-09 03:45:29,731 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 03:45:29,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:29,734 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 53 mSDsluCounter, 3458 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4333 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:29,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4333 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:45:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 03:45:29,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 557. [2025-01-09 03:45:29,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 438 states have (on average 1.6484018264840183) internal successors, (722), 457 states have internal predecessors, (722), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 03:45:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 907 transitions. [2025-01-09 03:45:29,753 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 907 transitions. Word has length 97 [2025-01-09 03:45:29,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:29,753 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 907 transitions. [2025-01-09 03:45:29,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 907 transitions. [2025-01-09 03:45:29,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 03:45:29,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:29,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:45:29,756 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:29,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:29,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1530908866, now seen corresponding path program 1 times [2025-01-09 03:45:29,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:29,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950827582] [2025-01-09 03:45:29,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:29,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:29,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 03:45:29,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 03:45:29,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:29,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:29,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:29,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950827582] [2025-01-09 03:45:29,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950827582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:29,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:29,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:29,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660670463] [2025-01-09 03:45:29,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:29,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:29,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:29,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:29,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:29,918 INFO L87 Difference]: Start difference. First operand 557 states and 907 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:45:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:29,980 INFO L93 Difference]: Finished difference Result 1062 states and 1746 transitions. [2025-01-09 03:45:29,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:29,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 97 [2025-01-09 03:45:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:29,986 INFO L225 Difference]: With dead ends: 1062 [2025-01-09 03:45:29,986 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 03:45:29,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:29,989 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 84 mSDsluCounter, 4407 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5303 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:29,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5303 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 03:45:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-01-09 03:45:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 417 states have (on average 1.6498800959232613) internal successors, (688), 436 states have internal predecessors, (688), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 03:45:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 873 transitions. [2025-01-09 03:45:30,007 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 873 transitions. Word has length 97 [2025-01-09 03:45:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:30,008 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 873 transitions. [2025-01-09 03:45:30,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:45:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 873 transitions. [2025-01-09 03:45:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:45:30,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:30,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:30,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:45:30,011 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:30,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1388934143, now seen corresponding path program 1 times [2025-01-09 03:45:30,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:30,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71909804] [2025-01-09 03:45:30,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:30,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:30,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:45:30,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:45:30,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:30,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:30,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:30,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71909804] [2025-01-09 03:45:30,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71909804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:30,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:30,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:30,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377479611] [2025-01-09 03:45:30,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:30,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:30,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:30,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:30,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:30,133 INFO L87 Difference]: Start difference. First operand 536 states and 873 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:30,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:30,201 INFO L93 Difference]: Finished difference Result 1041 states and 1712 transitions. [2025-01-09 03:45:30,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:30,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2025-01-09 03:45:30,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:30,206 INFO L225 Difference]: With dead ends: 1041 [2025-01-09 03:45:30,206 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 03:45:30,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:30,209 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 17 mSDsluCounter, 3415 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4271 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:30,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4271 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:30,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 03:45:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-01-09 03:45:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 417 states have (on average 1.6474820143884892) internal successors, (687), 436 states have internal predecessors, (687), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 03:45:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 872 transitions. [2025-01-09 03:45:30,227 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 872 transitions. Word has length 98 [2025-01-09 03:45:30,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:30,227 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 872 transitions. [2025-01-09 03:45:30,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 872 transitions. [2025-01-09 03:45:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 03:45:30,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:30,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:30,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:45:30,231 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:30,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:30,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2081245187, now seen corresponding path program 1 times [2025-01-09 03:45:30,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:30,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541740615] [2025-01-09 03:45:30,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:30,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:30,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:45:30,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:45:30,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:30,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:30,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:30,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:30,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541740615] [2025-01-09 03:45:30,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541740615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:30,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:30,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:30,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617670298] [2025-01-09 03:45:30,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:30,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:30,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:30,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:30,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:30,346 INFO L87 Difference]: Start difference. First operand 536 states and 872 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:30,413 INFO L93 Difference]: Finished difference Result 1041 states and 1711 transitions. [2025-01-09 03:45:30,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:30,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2025-01-09 03:45:30,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:30,418 INFO L225 Difference]: With dead ends: 1041 [2025-01-09 03:45:30,418 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 03:45:30,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:30,422 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 16 mSDsluCounter, 3415 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4271 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:30,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4271 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:30,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 03:45:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-01-09 03:45:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 417 states have (on average 1.645083932853717) internal successors, (686), 436 states have internal predecessors, (686), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 03:45:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 871 transitions. [2025-01-09 03:45:30,439 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 871 transitions. Word has length 99 [2025-01-09 03:45:30,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:30,439 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 871 transitions. [2025-01-09 03:45:30,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 871 transitions. [2025-01-09 03:45:30,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 03:45:30,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:30,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:30,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:45:30,443 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:30,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:30,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1806444838, now seen corresponding path program 1 times [2025-01-09 03:45:30,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:30,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371750392] [2025-01-09 03:45:30,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:30,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:30,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 03:45:30,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:45:30,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:30,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:30,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:30,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371750392] [2025-01-09 03:45:30,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371750392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:30,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:30,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:30,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30691876] [2025-01-09 03:45:30,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:30,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:30,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:30,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:30,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:30,558 INFO L87 Difference]: Start difference. First operand 536 states and 871 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:30,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:30,599 INFO L93 Difference]: Finished difference Result 1035 states and 1699 transitions. [2025-01-09 03:45:30,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:30,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2025-01-09 03:45:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:30,604 INFO L225 Difference]: With dead ends: 1035 [2025-01-09 03:45:30,604 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 03:45:30,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:30,607 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 5 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2567 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:30,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2567 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:30,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 03:45:30,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-01-09 03:45:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 417 states have (on average 1.6426858513189448) internal successors, (685), 436 states have internal predecessors, (685), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 03:45:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 870 transitions. [2025-01-09 03:45:30,628 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 870 transitions. Word has length 100 [2025-01-09 03:45:30,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:30,629 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 870 transitions. [2025-01-09 03:45:30,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:45:30,629 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 870 transitions. [2025-01-09 03:45:30,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:45:30,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:30,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:30,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:45:30,633 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:30,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:30,634 INFO L85 PathProgramCache]: Analyzing trace with hash 457723880, now seen corresponding path program 1 times [2025-01-09 03:45:30,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:30,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936589085] [2025-01-09 03:45:30,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:30,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:30,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:45:30,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:45:30,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:30,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:30,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:30,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936589085] [2025-01-09 03:45:30,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936589085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:30,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:30,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:45:30,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464540046] [2025-01-09 03:45:30,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:30,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:45:30,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:30,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:45:30,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:30,862 INFO L87 Difference]: Start difference. First operand 536 states and 870 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 03:45:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:32,443 INFO L93 Difference]: Finished difference Result 1031 states and 1711 transitions. [2025-01-09 03:45:32,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:45:32,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 101 [2025-01-09 03:45:32,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:32,449 INFO L225 Difference]: With dead ends: 1031 [2025-01-09 03:45:32,449 INFO L226 Difference]: Without dead ends: 540 [2025-01-09 03:45:32,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:45:32,452 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 1335 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 2800 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 2800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:32,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 1568 Invalid, 3190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 2800 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 03:45:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-01-09 03:45:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-01-09 03:45:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 420 states have (on average 1.638095238095238) internal successors, (688), 439 states have internal predecessors, (688), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (106), 89 states have call predecessors, (106), 90 states have call successors, (106) [2025-01-09 03:45:32,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 889 transitions. [2025-01-09 03:45:32,475 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 889 transitions. Word has length 101 [2025-01-09 03:45:32,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:32,475 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 889 transitions. [2025-01-09 03:45:32,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 03:45:32,475 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 889 transitions. [2025-01-09 03:45:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:45:32,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:32,478 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] [2025-01-09 03:45:32,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:45:32,478 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:32,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:32,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1110914650, now seen corresponding path program 1 times [2025-01-09 03:45:32,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:32,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801499926] [2025-01-09 03:45:32,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:32,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:32,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:45:32,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:45:32,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:32,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:32,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:32,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801499926] [2025-01-09 03:45:32,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801499926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:32,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:32,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:32,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001783252] [2025-01-09 03:45:32,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:32,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:32,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:32,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:32,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:32,609 INFO L87 Difference]: Start difference. First operand 540 states and 889 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 03:45:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:35,482 INFO L93 Difference]: Finished difference Result 1944 states and 3309 transitions. [2025-01-09 03:45:35,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 03:45:35,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 102 [2025-01-09 03:45:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:35,492 INFO L225 Difference]: With dead ends: 1944 [2025-01-09 03:45:35,492 INFO L226 Difference]: Without dead ends: 1449 [2025-01-09 03:45:35,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-01-09 03:45:35,497 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 2448 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 5070 mSolverCounterSat, 614 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2527 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 5684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 614 IncrementalHoareTripleChecker+Valid, 5070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:35,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2527 Valid, 2525 Invalid, 5684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [614 Valid, 5070 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 03:45:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2025-01-09 03:45:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1391. [2025-01-09 03:45:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1078 states have (on average 1.6493506493506493) internal successors, (1778), 1126 states have internal predecessors, (1778), 249 states have call successors, (249), 63 states have call predecessors, (249), 63 states have return successors, (270), 238 states have call predecessors, (270), 244 states have call successors, (270) [2025-01-09 03:45:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 2297 transitions. [2025-01-09 03:45:35,573 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 2297 transitions. Word has length 102 [2025-01-09 03:45:35,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:35,574 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 2297 transitions. [2025-01-09 03:45:35,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 03:45:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 2297 transitions. [2025-01-09 03:45:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 03:45:35,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:35,576 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] [2025-01-09 03:45:35,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:45:35,577 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:35,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:35,578 INFO L85 PathProgramCache]: Analyzing trace with hash -281196135, now seen corresponding path program 1 times [2025-01-09 03:45:35,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:35,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583836570] [2025-01-09 03:45:35,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:35,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:35,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 03:45:35,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 03:45:35,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:35,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:45:35,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:35,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583836570] [2025-01-09 03:45:35,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583836570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:35,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:35,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:35,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271711670] [2025-01-09 03:45:35,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:35,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:35,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:35,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:35,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:35,704 INFO L87 Difference]: Start difference. First operand 1391 states and 2297 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-09 03:45:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:38,272 INFO L93 Difference]: Finished difference Result 5014 states and 8521 transitions. [2025-01-09 03:45:38,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:38,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 104 [2025-01-09 03:45:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:38,293 INFO L225 Difference]: With dead ends: 5014 [2025-01-09 03:45:38,293 INFO L226 Difference]: Without dead ends: 3669 [2025-01-09 03:45:38,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:45:38,299 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 3443 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 3440 mSolverCounterSat, 1026 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3485 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 4466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1026 IncrementalHoareTripleChecker+Valid, 3440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:38,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3485 Valid, 2205 Invalid, 4466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1026 Valid, 3440 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 03:45:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2025-01-09 03:45:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 3258. [2025-01-09 03:45:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3258 states, 2405 states have (on average 1.636174636174636) internal successors, (3935), 2551 states have internal predecessors, (3935), 720 states have call successors, (720), 121 states have call predecessors, (720), 132 states have return successors, (821), 707 states have call predecessors, (821), 715 states have call successors, (821) [2025-01-09 03:45:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 3258 states and 5476 transitions. [2025-01-09 03:45:38,517 INFO L78 Accepts]: Start accepts. Automaton has 3258 states and 5476 transitions. Word has length 104 [2025-01-09 03:45:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:38,517 INFO L471 AbstractCegarLoop]: Abstraction has 3258 states and 5476 transitions. [2025-01-09 03:45:38,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-09 03:45:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3258 states and 5476 transitions. [2025-01-09 03:45:38,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 03:45:38,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:38,520 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] [2025-01-09 03:45:38,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:45:38,520 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:38,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:38,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1791972097, now seen corresponding path program 1 times [2025-01-09 03:45:38,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:38,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008387229] [2025-01-09 03:45:38,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:38,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:38,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 03:45:38,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 03:45:38,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:38,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:45:38,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:38,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008387229] [2025-01-09 03:45:38,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008387229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:38,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:38,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:38,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756891024] [2025-01-09 03:45:38,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:38,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:38,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:38,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:38,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:38,638 INFO L87 Difference]: Start difference. First operand 3258 states and 5476 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-09 03:45:41,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:41,093 INFO L93 Difference]: Finished difference Result 12863 states and 22291 transitions. [2025-01-09 03:45:41,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:41,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 105 [2025-01-09 03:45:41,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:41,146 INFO L225 Difference]: With dead ends: 12863 [2025-01-09 03:45:41,147 INFO L226 Difference]: Without dead ends: 9652 [2025-01-09 03:45:41,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:45:41,165 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 3456 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 3409 mSolverCounterSat, 1046 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3499 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 4455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1046 IncrementalHoareTripleChecker+Valid, 3409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:41,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3499 Valid, 2218 Invalid, 4455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1046 Valid, 3409 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 03:45:41,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9652 states. [2025-01-09 03:45:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9652 to 8395. [2025-01-09 03:45:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8395 states, 5866 states have (on average 1.6181384248210025) internal successors, (9492), 6298 states have internal predecessors, (9492), 2243 states have call successors, (2243), 237 states have call predecessors, (2243), 285 states have return successors, (2679), 2238 states have call predecessors, (2679), 2238 states have call successors, (2679) [2025-01-09 03:45:41,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8395 states to 8395 states and 14414 transitions. [2025-01-09 03:45:41,717 INFO L78 Accepts]: Start accepts. Automaton has 8395 states and 14414 transitions. Word has length 105 [2025-01-09 03:45:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:41,718 INFO L471 AbstractCegarLoop]: Abstraction has 8395 states and 14414 transitions. [2025-01-09 03:45:41,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-09 03:45:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 8395 states and 14414 transitions. [2025-01-09 03:45:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:45:41,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:41,725 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] [2025-01-09 03:45:41,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:45:41,726 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:41,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash 807175540, now seen corresponding path program 1 times [2025-01-09 03:45:41,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:41,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815247798] [2025-01-09 03:45:41,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:41,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:41,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:45:41,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:45:41,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:41,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:45:41,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:41,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815247798] [2025-01-09 03:45:41,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815247798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:41,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:41,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:41,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873640076] [2025-01-09 03:45:41,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:41,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:41,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:41,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:41,864 INFO L87 Difference]: Start difference. First operand 8395 states and 14414 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-09 03:45:45,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:45,491 INFO L93 Difference]: Finished difference Result 36444 states and 64546 transitions. [2025-01-09 03:45:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:45,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 106 [2025-01-09 03:45:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:45,763 INFO L225 Difference]: With dead ends: 36444 [2025-01-09 03:45:45,764 INFO L226 Difference]: Without dead ends: 28098 [2025-01-09 03:45:45,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:45:45,815 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 3468 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 3414 mSolverCounterSat, 1050 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3512 SdHoareTripleChecker+Valid, 2239 SdHoareTripleChecker+Invalid, 4464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1050 IncrementalHoareTripleChecker+Valid, 3414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:45,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3512 Valid, 2239 Invalid, 4464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1050 Valid, 3414 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 03:45:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28098 states. [2025-01-09 03:45:47,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28098 to 23924. [2025-01-09 03:45:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23924 states, 15866 states have (on average 1.6009076011597125) internal successors, (25400), 17185 states have internal predecessors, (25400), 7412 states have call successors, (7412), 469 states have call predecessors, (7412), 645 states have return successors, (9323), 7471 states have call predecessors, (9323), 7407 states have call successors, (9323) [2025-01-09 03:45:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23924 states to 23924 states and 42135 transitions. [2025-01-09 03:45:47,701 INFO L78 Accepts]: Start accepts. Automaton has 23924 states and 42135 transitions. Word has length 106 [2025-01-09 03:45:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:47,702 INFO L471 AbstractCegarLoop]: Abstraction has 23924 states and 42135 transitions. [2025-01-09 03:45:47,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-09 03:45:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 23924 states and 42135 transitions. [2025-01-09 03:45:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:45:47,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:47,704 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] [2025-01-09 03:45:47,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:45:47,705 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:47,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:47,705 INFO L85 PathProgramCache]: Analyzing trace with hash -485248964, now seen corresponding path program 1 times [2025-01-09 03:45:47,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:47,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560672130] [2025-01-09 03:45:47,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:47,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:47,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:45:47,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:45:47,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:47,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:45:47,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:47,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560672130] [2025-01-09 03:45:47,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560672130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:47,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:47,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:47,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437578811] [2025-01-09 03:45:47,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:47,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:47,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:47,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:47,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:47,803 INFO L87 Difference]: Start difference. First operand 23924 states and 42135 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-09 03:45:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:55,199 INFO L93 Difference]: Finished difference Result 112891 states and 204460 transitions. [2025-01-09 03:45:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:55,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 107 [2025-01-09 03:45:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:55,842 INFO L225 Difference]: With dead ends: 112891 [2025-01-09 03:45:55,842 INFO L226 Difference]: Without dead ends: 89020 [2025-01-09 03:45:55,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:45:55,988 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 3480 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 3423 mSolverCounterSat, 1052 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3525 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 4475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1052 IncrementalHoareTripleChecker+Valid, 3423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:55,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3525 Valid, 2260 Invalid, 4475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1052 Valid, 3423 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 03:45:56,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89020 states. [2025-01-09 03:46:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89020 to 74673. [2025-01-09 03:46:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74673 states, 47662 states have (on average 1.5888548529226638) internal successors, (75728), 51844 states have internal predecessors, (75728), 25441 states have call successors, (25441), 933 states have call predecessors, (25441), 1569 states have return successors, (33789), 25820 states have call predecessors, (33789), 25436 states have call successors, (33789) [2025-01-09 03:46:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74673 states to 74673 states and 134958 transitions. [2025-01-09 03:46:02,377 INFO L78 Accepts]: Start accepts. Automaton has 74673 states and 134958 transitions. Word has length 107 [2025-01-09 03:46:02,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:02,378 INFO L471 AbstractCegarLoop]: Abstraction has 74673 states and 134958 transitions. [2025-01-09 03:46:02,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-09 03:46:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand 74673 states and 134958 transitions. [2025-01-09 03:46:02,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:46:02,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:02,380 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] [2025-01-09 03:46:02,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:46:02,380 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:02,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:02,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1570762063, now seen corresponding path program 1 times [2025-01-09 03:46:02,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:02,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992773168] [2025-01-09 03:46:02,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:02,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:02,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:46:02,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:46:02,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:02,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:46:02,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:02,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992773168] [2025-01-09 03:46:02,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992773168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:02,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:02,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:46:02,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938370207] [2025-01-09 03:46:02,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:02,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:46:02,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:02,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:46:02,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:46:02,486 INFO L87 Difference]: Start difference. First operand 74673 states and 134958 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11)